Complexity Theory
Finding ψ(G) is an optimization problem. The decision problem for complete coloring can be phrased as:
- INSTANCE: a graph and positive integer
- QUESTION: does there exist a partition of into or more disjoint sets such that each is an independent set for and such that for each pair of distinct sets is not an independent set.
Determining the achromatic number is NP-hard; determining if it is greater than a given number is NP-complete, as shown by Yannakakis and Gavril in 1978 by transformation from the minimum maximal matching problem.
Note that any coloring of a graph with the minimum number of colors must be a complete coloring, so minimizing the number of colors in a complete coloring is just a restatement of the standard graph coloring problem.
Read more about this topic: Complete Coloring
Famous quotes containing the words complexity and/or theory:
“In times like ours, where the growing complexity of life leaves us barely the time to read the newspapers, where the map of Europe has endured profound rearrangements and is perhaps on the brink of enduring yet others, where so many threatening and new problems appear everywhere, you will admit it may be demanded of a writer that he be more than a fine wit who makes us forget in idle and byzantine discussions on the merits of pure form ...”
—Marcel Proust (1871–1922)
“The things that will destroy America are prosperity-at-any- price, peace-at-any-price, safety-first instead of duty-first, the love of soft living, and the get-rich-quick theory of life.”
—Theodore Roosevelt (1858–1919)