Librería: California Books, Miami, FL, Estados Unidos de America
EUR 59,42
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 59,42
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Jaypee Brothers Medical Publishers (P) Ltd., 2008
ISBN 10: 8184484402 ISBN 13: 9788184484403
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 61,18
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 250 Index 1st Edition.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 71,74
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 74,86
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 148 pages. 6.00x0.34x9.00 inches. In Stock.
EUR 74,93
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 153 pages. 6.00x0.35x9.00 inches. In Stock.
Idioma: Inglés
Publicado por LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202519916 ISBN 13: 9786202519915
Librería: preigu, Osnabrück, Alemania
EUR 53,30
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Designing Parallel Graph Coloring Algorithm - A Research Perspective | Design and Analysis of Algorithms | Harish Patidar (u. a.) | Taschenbuch | 148 S. | Englisch | 2020 | LAP LAMBERT Academic Publishing | EAN 9786202519915 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
Idioma: Inglés
Publicado por LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202519916 ISBN 13: 9786202519915
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 180,45
Cantidad disponible: 1 disponibles
Añadir al carritopaperback. Condición: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Idioma: Inglés
Publicado por Jaypee Brothers Medical Publishers (P) Ltd., 2008
ISBN 10: 8184484402 ISBN 13: 9788184484403
Librería: Majestic Books, Hounslow, Reino Unido
EUR 59,21
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 250.
Idioma: Inglés
Publicado por Jaypee Brothers Medical Publishers (P) Ltd., 2008
ISBN 10: 8184484402 ISBN 13: 9788184484403
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 57,64
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 250.
Idioma: Inglés
Publicado por LAP LAMBERT Academic Publishing Mrz 2020, 2020
ISBN 10: 6202519916 ISBN 13: 9786202519915
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 61,90
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. 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.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 85,62
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 85,67
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 91,31
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 91,37
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 87,09
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 87,02
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Idioma: Inglés
Publicado por LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202519916 ISBN 13: 9786202519915
Librería: moluna, Greven, Alemania
EUR 50,66
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondició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.
Idioma: Inglés
Publicado por LAP LAMBERT Academic Publishing Mär 2020, 2020
ISBN 10: 6202519916 ISBN 13: 9786202519915
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 61,90
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. 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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 148 pp. Englisch.
Idioma: Inglés
Publicado por LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202519916 ISBN 13: 9786202519915
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 62,64
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. 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.