论文信息 - Maximizing the Number of Unused Colors in the Vertex Coloring Problem - 字舞流文

Maximizing the Number of Unused Colors in the Vertex Coloring Problem

Refael Hassin | Shlomo Lahav | Refael Hassin | Shlomo Lahav

[1] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[2] Vangelis Th. Paschos,et al. Approximation Results for the Minimum Graph Coloring Problem , 1994, Inf. Process. Lett..

[3] Shimon Even,et al. An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[4] Vijay V. Vazirani,et al. A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm , 1990, Comb..

[5] Carsten Lund,et al. On the hardness of approximating minimization problems , 1993, STOC.

[6] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).