Articles liés à Designing Parallel Graph Coloring Algorithm - A Research...
Designing Parallel Graph Coloring Algorithm - A Research Perspective: Design and Analysis of Algorithms - Couverture souple
Synopsis
Graph Coloring Problem is a well know NP-Hard problem. In vertex coloring problem all vertices of any graph must be colored in such a way that no two adjacent vertices colored with same color. In this research work two different algorithms are proposed to solve vertex coloring problems, Edge Cover based Graph Coloring Algorithm (ECGCA) and Tree Data Structure based Graph Coloring Algorithm (TGCA). One parallel version of ECGCA, Parallel Edge Cover based Graph Coloring Algorithm (PECGCA) is also proposed. ECGCA algorithm is based on finding vertex sets using edge cover method. In this research work implementation prospective of algorithm are also covered. Implemented algorithm is tested on various graph instances of DIMACS standards dataset. Algorithm execution time and number of colored required to color graph are compared with some other well know Graph Coloring Algorithms. Variation in time complexity with reference to increasing in number of vertices, number of edges and average degree of graph is also analyzed in this research work. In PECGCA enhanced parallel edge cover based graph coloring algorithm by incorporating parallel computing aspects in algorithm is introduced.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 50,66
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour Designing Parallel Graph Coloring Algorithm - A Research...
Image fournie par le vendeur
Designing Parallel Graph Coloring Algorithm - A Research Perspective
Edité par
LAP LAMBERT Academic Publishing, 2020
ISBN 10 : 6202519916
ISBN 13 : 9786202519915
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Patidar HarishDr Harish Patidar is working as Associate Professor and Head, Department of Computer Science and Engineering, LNCT Indore. Prof Prasun Chakrabarti is working as Executive Dean (Research) and Institute Distinguished Seni. N° de réf. du vendeur 385945759
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Designing Parallel Graph Coloring Algorithm - A Research Perspective
Edité par
LAP LAMBERT Academic Publishing Mrz 2020, 2020
ISBN 10 : 6202519916
ISBN 13 : 9786202519915
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Graph Coloring Problem is a well know NP-Hard problem. In vertex coloring problem all vertices of any graph must be colored in such a way that no two adjacent vertices colored with same color. In this research work two different algorithms are proposed to solve vertex coloring problems, Edge Cover based Graph Coloring Algorithm (ECGCA) and Tree Data Structure based Graph Coloring Algorithm (TGCA). One parallel version of ECGCA, Parallel Edge Cover based Graph Coloring Algorithm (PECGCA) is also proposed. ECGCA algorithm is based on finding vertex sets using edge cover method. In this research work implementation prospective of algorithm are also covered. Implemented algorithm is tested on various graph instances of DIMACS standards dataset. Algorithm execution time and number of colored required to color graph are compared with some other well know Graph Coloring Algorithms. Variation in time complexity with reference to increasing in number of vertices, number of edges and average degree of graph is also analyzed in this research work. In PECGCA enhanced parallel edge cover based graph coloring algorithm by incorporating parallel computing aspects in algorithm is introduced. 148 pp. Englisch. N° de réf. du vendeur 9786202519915
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Designing Parallel Graph Coloring Algorithm - A Research Perspective : Design and Analysis of Algorithms
Edité par
LAP LAMBERT Academic Publishing, 2020
ISBN 10 : 6202519916
ISBN 13 : 9786202519915
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Graph Coloring Problem is a well know NP-Hard problem. In vertex coloring problem all vertices of any graph must be colored in such a way that no two adjacent vertices colored with same color. In this research work two different algorithms are proposed to solve vertex coloring problems, Edge Cover based Graph Coloring Algorithm (ECGCA) and Tree Data Structure based Graph Coloring Algorithm (TGCA). One parallel version of ECGCA, Parallel Edge Cover based Graph Coloring Algorithm (PECGCA) is also proposed. ECGCA algorithm is based on finding vertex sets using edge cover method. In this research work implementation prospective of algorithm are also covered. Implemented algorithm is tested on various graph instances of DIMACS standards dataset. Algorithm execution time and number of colored required to color graph are compared with some other well know Graph Coloring Algorithms. Variation in time complexity with reference to increasing in number of vertices, number of edges and average degree of graph is also analyzed in this research work. In PECGCA enhanced parallel edge cover based graph coloring algorithm by incorporating parallel computing aspects in algorithm is introduced. N° de réf. du vendeur 9786202519915
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Designing Parallel Graph Coloring Algorithm - A Research Perspective
Edité par
LAP LAMBERT Academic Publishing Mär 2020, 2020
ISBN 10 : 6202519916
ISBN 13 : 9786202519915
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -Graph Coloring Problem is a well know NP-Hard problem. In vertex coloring problem all vertices of any graph must be colored in such a way that no two adjacent vertices colored with same color. In this research work two different algorithms are proposed to solve vertex coloring problems, Edge Cover based Graph Coloring Algorithm (ECGCA) and Tree Data Structure based Graph Coloring Algorithm (TGCA). One parallel version of ECGCA, Parallel Edge Cover based Graph Coloring Algorithm (PECGCA) is also proposed. ECGCA algorithm is based on finding vertex sets using edge cover method. In this research work implementation prospective of algorithm are also covered. Implemented algorithm is tested on various graph instances of DIMACS standards dataset. Algorithm execution time and number of colored required to color graph are compared with some other well know Graph Coloring Algorithms. Variation in time complexity with reference to increasing in number of vertices, number of edges and average degree of graph is also analyzed in this research work. In PECGCA enhanced parallel edge cover based graph coloring algorithm by incorporating parallel computing aspects in algorithm is introduced.Books on Demand GmbH, Überseering 33, 22297 Hamburg 148 pp. Englisch. N° de réf. du vendeur 9786202519915
Quantité disponible : 2 disponible(s)
Image d'archives
Designing Parallel Graph Coloring Algorithm - A Research Perspective: Design and Analysis of Algorithms
Edité par
LAP LAMBERT Academic Publishing, 2020
ISBN 10 : 6202519916
ISBN 13 : 9786202519915
Neuf
paperback
Vendeur : dsmbooks, Liverpool, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
paperback. Etat : New. New. book. N° de réf. du vendeur D8S0-3-M-6202519916-6
Quantité disponible : 1 disponible(s)