z-logo
open-access-imgOpen Access
Parallel Computing Aspects in Improved Edge Cover Based Graph Coloring Algorithm
Author(s) -
Harish Patidar,
Prąsun Chakrabarti,
Amrit Ghosh
Publication year - 2017
Publication title -
indian journal of science and technology
Language(s) - English
Resource type - Journals
eISSN - 0974-6846
pISSN - 0974-5645
DOI - 10.17485/ijst/2017/v10i25/115117
Subject(s) - computer science , algorithm , graph coloring , floyd–warshall algorithm , greedy coloring , edge coloring , graph , theoretical computer science , graph power , shortest path problem , dijkstra's algorithm , line graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here