Linear kernels in linear time, or how to save k Colors in O(n2) Steps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3353, Issue , 2004, Pages 257-269

  Chor, Benny ^a   Fellows, Mike ^b   Juedes, David ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c OHIO UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PARAMETER ESTIMATION; PARAMETERIZATION; CLUSTERING ALGORITHMS;

GRAPH G; K-CLIQUE; KERNALIZATION; KERNELIZATION; LINEAR KERNEL; LINEAR TIME; MAXIMAL MATCHINGS; NEAR-LINEAR TIME; PARAMETERIZED ALGORITHM; PARAMETERIZED PROBLEMS; GRAPH COLORINGS; REDUCTION RULES; TECHNICAL CONTENT;

CLUSTERING ALGORITHMS; GRAPH THEORY;

EID: 35048876678     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30559-0_22     Document Type: Article

References (20)

1. Garey, M.R., Johnson, D.S.: Computers and Intractability: a guide to the theory of NP-completeness. W.H. Freeman (1979)
2. Halldórsson, M.M.: A still better performance guarantee for approximate graph coloring. Information Processing Letters 45 (1993) 19-23
3. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM 41 (1994) 960-981
4. Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability - towards tight results. SIAM Journal on Computing 27 (1998) 804-915
5. Feige, U., Kilian, J.: Zero knowledge and the chromatic number. In: Proceedings of the Eleventh Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press (1996) 278-289
6. Demange, M., Grisoni, P., Paschos, V.T.: Approximation results for the minimum graph coloring problem. Information Processing Letters 50 (1994) 19-23
7. Hassin, R., Lahav, S.: Maximizing the number of unused colors in the vertex coloring problem. Information Processing Letters 52 (1994) 87-90
8. Halldórsson, M.M.: Approximating discrete collections via local improvement. In: Proceedings of the Sixth ACM-SIAM Symposium on Discrete Algorithms, ACM Press (1995) 160-169
9. Halldórsson, M.M.: Approximating k-set cover and complementary graph coloring. In: Proceedings of the 5th IPCO Conference on Integer Programming and Combinatorial Optimization. Volume 1084 of LNCS., Springer-Verlag (1996) 118-131
10. c. Duh, R., Fürer, M.: Approximation of k-set cover by semi-local optimization. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, ACM Press (1997) 256-264
11. Downey, R., Fellows, M.R.: Parameterized Complexity. Springer-Verlag (1999)
12. Eppstein, D.: Small maximal independent sets and faster exact graph coloring. In: Algorithms and Data Structures: 7th International Workshop, WADS 2001. Volume 2125 of Lecture Notes in Computer Science., Springer-Verlag (2001) 462-470
13. Papadimitriou, C.H., Yannakakis, M.: On limited nondeterminism and the complexity of the V-C dimension. Journal of Computer and System Sciences 53 (1996)
14. Chen, J., Kanj, I., Jia, W.: Vertex covenfurther observations and further improvements. Journal of Algorithms 41 (2001) 280-301
15. Nemhauser, G.L., Trotter, L.E.: Vertex packings: Structural properties and algorithms. Mathematical Programming 8 (1975) 232-248
16. Galil, Z.: Efficient algorithms for finding maximum matching in graphs. ACM Computing Surveys 18 (1986) 23-38
17. Lovász, L., Plummer, M.D.: Matching Theory. Volume 29 of Annals of Discrete Mathematics. North Holland, Amsterdam (1986)
18. Berge, C.: Two theorems in graph theory. Proceedings of the National Academy of Sciences U.S.A. 43 (1957) 842-844
19. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2 (1973) 225-231
20. Micali, S., Vazirani, V.V.: An O√/|v| · |E|) algorithm for finding maximum matching in general graphs. In: 21st Annual Symposium on Foundations of Computer Science, Syracuse, New York, IEEE (1980) 17-27