Artículos relacionados a Designing Parallel Graph Coloring Algorithm - A Research...
Designing Parallel Graph Coloring Algorithm - A Research Perspective: Design and Analysis of Algorithms - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 50,66
EUR 19,49 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Designing Parallel Graph Coloring Algorithm - A Research...
Imagen del vendedor
Designing Parallel Graph Coloring Algorithm - A Research Perspective
Publicado por
LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202519916
ISBN 13: 9786202519915
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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 ref. del artículo: 385945759
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Designing Parallel Graph Coloring Algorithm - A Research Perspective
Publicado por
LAP LAMBERT Academic Publishing Mrz 2020, 2020
ISBN 10: 6202519916
ISBN 13: 9786202519915
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9786202519915
Cantidad disponible: 2 disponibles
Imagen del vendedor
Designing Parallel Graph Coloring Algorithm - A Research Perspective : Design and Analysis of Algorithms
Publicado por
LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202519916
ISBN 13: 9786202519915
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9786202519915
Cantidad disponible: 1 disponibles
Imagen del vendedor
Designing Parallel Graph Coloring Algorithm - A Research Perspective
Publicado por
LAP LAMBERT Academic Publishing Mär 2020, 2020
ISBN 10: 6202519916
ISBN 13: 9786202519915
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9786202519915
Cantidad disponible: 2 disponibles
Imagen de archivo
Designing Parallel Graph Coloring Algorithm - A Research Perspective: Design and Analysis of Algorithms
Publicado por
LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202519916
ISBN 13: 9786202519915
Nuevo
paperback
Librería: dsmbooks, Liverpool, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
paperback. Condición: New. New. book. Nº de ref. del artículo: D8S0-3-M-6202519916-6
Cantidad disponible: 1 disponibles