Items related to Designing Parallel Graph Coloring Algorithm - A Research...
Designing Parallel Graph Coloring Algorithm - A Research Perspective: Design and Analysis of Algorithms - Softcover
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.
"synopsis" may belong to another edition of this title.
Buy New
View this item
US$ 75.24
US$ 27.14 shipping from Germany to U.S.A.
Destination, rates & speedsSearch results for Designing Parallel Graph Coloring Algorithm - A Research...
Seller Image
Designing Parallel Graph Coloring Algorithm - A Research Perspective
Published by
LAP LAMBERT Academic Publishing Mrz 2020, 2020
ISBN 10: 6202519916
ISBN 13: 9786202519915
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786202519915
Quantity: 2 available
Seller Image
Designing Parallel Graph Coloring Algorithm - A Research Perspective : Design and Analysis of Algorithms
Published by
LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202519916
ISBN 13: 9786202519915
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786202519915
Quantity: 1 available
Seller Image
Designing Parallel Graph Coloring Algorithm - A Research Perspective
Published by
LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202519916
ISBN 13: 9786202519915
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 385945759
Quantity: Over 20 available
Seller Image
Designing Parallel Graph Coloring Algorithm - A Research Perspective
Published by
LAP LAMBERT Academic Publishing Mär 2020, 2020
ISBN 10: 6202519916
ISBN 13: 9786202519915
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786202519915
Quantity: 2 available
Stock Image
Designing Parallel Graph Coloring Algorithm - A Research Perspective: Design and Analysis of Algorithms
Published by
LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202519916
ISBN 13: 9786202519915
New
paperback
Seller: dsmbooks, Liverpool, United Kingdom
Seller rating 4 out of 5 stars
paperback. Condition: New. New. book. Seller Inventory # D8S0-3-M-6202519916-6
Quantity: 1 available