Improved edge-coloring with three colors

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

Volumn 4271 LNCS, Issue , 2006, Pages 90-101

  Kowalik, Łukasz ^a,b  

^a UNIVERSITY OF WARSAW   (Poland)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLOR IMAGE PROCESSING; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

EDGE COLORING; INCLUSION MAXIMAL MATCHINGS; POLYNOMIAL SPACE; TIME COMPLEXITY;

EDGE DETECTION;

EID: 33845528813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11917496_9     Document Type: Conference Paper

References (9)

1. n). J. Algorithms, 54(2):168-204, February 2005.
2. D. Eppstein. The traveling salesman problem for cubic graphs. In Proc. 8th Int. Workshop on Algorithms and Data Str. (WADS'03), volume 2748 of LNCS, pages 307-318, 2003.
3. D. Eppstein. Quasiconvex analysis of backtracking algorithms. In Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), pages 781-790, 2004.
4. F. Fomin. Personal communication, 2006.
5. F. Fomin, F. Grandoni, and D. Kratsch. Measure and conquer: Domination - a case study. In Proc. 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), pages 191-203, 2005.
6. 0.288n) independent set algorithm. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '06), pages 18-25, 2006.
7. F. Fomin and K. Høie. Pathwidth of cubic graphs and exact algorithms. Information Processing Letters, 97(5):191-196, 2006.
8. E. L. Lawler. A note on the complexity of the chromatic number problem. Information Processing Letters, (5):66-67, 1976.
9. V. G. Vizing. On the estimate of the chromatic class of a p-graph. Diskret. Analiz, 3:25-30, 1964.