Divide-and-color

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

Volumn 4271 LNCS, Issue , 2006, Pages 58-67

  Kneis, Joachim ^a   Mölle, Daniel ^a   Richter, Stefan ^a   Rossmanith, Peter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; PROBLEM SOLVING; RANDOM PROCESSES;

DERANDOMIZATION; DETERMINISTIC ALGORITHMS; DIVIDE AND COLOR; GENERIC ALGORITHMS;

GRAPH THEORY;

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

References (11)

1. N. Alon, O. Goldreich, J. Håstad, and R. Perelta. Simple constructions of almost k-wise independent random variables. Journal of Random structures and Algorithms, 3(3):289-304, 1992.
2. N. Alon, R. Yuster, and U. Zwick. Color-coding. J. ACM, 42(4):844-856, 1995.
3. M. Cesati. Compendium of parameterized problems, 2005. Available online at http://bravo.ce.uniroma2.it/home/cesati/research/compendium.ps.
4. B. Courcelle, J. A. Makowsky, and U. Rotics. Linear time solvable optimization problems on graphs of bounded clique width. In Proc. of 24th WG, number 1517 in LNCS, pages 1-16. Springer, 1998.
5. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
6. M. R. Fellows et al. Faster fixed-parameter tractable algorithms for matching and packing problems. In Proc. of 12th ESA, number 3221 in LNCS, pages 311-322. Springer, 2004.
7. M. Fredman, J. Komlos, and E. Szemeredi. Storing a sparse table with O(1) worst case access time. In Proc. of 23d FOCS, pages 165-169, 1982.
8. Y. Liu, S. Lu, J. Chen, and S.-H. Sze. Greedy localization, color-coding, and dynamic programming: Improved algorithms for matching and packing problems. In Proc. of 2nd IWPEC, number 4169 in LNCS. Springer, 2006. To appear.
9. L. Mathieson, E. Prieto, and P. Shaw. Packing edge disjoint triangles: A parameterized view. In Proc. of 1st IWPEC, number 3162 in LNCS, pages 127-137. Springer, 2004.
10. E. Prieto and C. Sloper. Looking at the stars. In Proc. of 1st IWPEC, number 3162 in LNCS. Springer, 2004.
11. C. F. Slot and P. van Emde Boas. On tape versus core; an application of space efficient hash functions to the invariance of space. Elektronische Informationsver-arbeitung und Kybernetik, 21(4/5):246-253, 1985.