Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

The Vertex Coloring Algorithm - Ashay Dharwadker

angļu valoda
2006-08-08
19,22 € 27,45 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 10-16 darba dienu laikā

30 dienu atgriešanas politika

We present a new polynomial-time algorithm for finding proper m-colorings of the vertices of a graph. We prove that every graph with n vertices and maximum vertex degree Delta must have chromatic number Chi(G) less than or equal to Delta+1 and that the algorithm will always find a proper m-coloring of the vertices of G with m less than or equal to Delta+1. Furthermore, we prove that this condition is the be ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

We present a new polynomial-time algorithm for finding proper m-colorings of the vertices of a graph. We prove that every graph with n vertices and maximum vertex degree Delta must have chromatic number Chi(G) less than or equal to Delta+1 and that the algorithm will always find a proper m-coloring of the vertices of G with m less than or equal to Delta+1. Furthermore, we prove that this condition is the best possible in terms of n and Delta by explicitly constructing graphs for which the chromatic number is exactly Delta+1. In the special case when G is a connected simple graph and is neither an odd cycle nor a complete graph, we show that the algorithm will always find a proper m-coloring of the vertices of G with m less than or equal to Delta. In the process, we obtain a new constructive proof of Brooks' famous theorem of 1941. For all known examples of graphs, the algorithm finds a proper m-coloring of the vertices of the graph G for m equal to the chromatic number Chi(G). In view of the importance of the P versus NP question, we ask: does there exist a graph G for which this algorithm cannot find a proper m-coloring of the vertices of G with m equal to the chromatic number Chi(G)? The algorithm is demonstrated with several examples of famous graphs, including a proper four-coloring of the map of India and two large Mycielski benchmark graphs with hidden minimum vertex colorings. We implement the algorithm in C++ and provide a demonstration program for Microsoft Windows.

Vairāk informācijas

Autors Ashay Dharwadker
Izdevējs Institute of Mathematics
Izlaides gads 2006
Vāka tips Mīkstais vāks
EAN 9781466391321
Rakstiet savu atsauksmi
Jūs vērtējat: The Vertex Coloring Algorithm
Jūsu novērtējums:

Goodreads atsauksmes

19,22 € 27,45 €