Two algorithms for general list matrix partitions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 870-876

  Feder, Tomás ^a   Hell, Pavol ^b   Král, Daniel ^c   Sgall, Jiří ^d  

^a Simon Fraser University ^*  (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

^c CHARLES UNIVERSITY   (Czech Republic)

^d MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

ADJACENCY MATRIX; DIGRAPHS; HOMOMORPHISM; QUASI-POLYNOMIALS;

ALGORITHMS;

EID: 20744459137     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. B. Aspvall, M. R. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters 8 (1979), pp. 121-123.
2. A. Brandstädt, P. L. Hammer, V. Bang Le, and V. V. Lozin, Bisplit graphs, DIMACS Technical Report 2002-44 and RUTCOR Research Report 2002-28, Rutgers University, Piscataway, NJ, 2002.
3. A. Brandstädt, P. L. Hammer, V. Bang Le, and V. V. Lozin, Bisplit graphs, to appear in Discrete Mathematics.
4. A. A. Bulatov, Tractable conservative constraint satisfaction problems, in: Proc. 18th IEEE Symposium on Logic in Computer Science (LICS) 2003, pp. 321-330.
5. K. Cameron, E. E. Eschen, C. T. Hoang, and R. Sritharan, The list partition problem for graphs, in: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2004, pp. 391-399.
6. S. Dantas, C. M. H. de Figueiredo, S. Gravier, and S. Klein, On H-partition problems, to appear in RAIRO - Theoretical Informatics and Applications. Tech. report PESC UFRJ ES-579/02, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brasil, 2002.
7. S. Dantas, C. M. H. de Figueiredo, S. Gravier, and S. Klein, Extended skew partition problems, to appear in Discrete Mathematics.
8. S. Dantas, C. M. H. de Figueiredo, S. Gravier, S. Klein, and B. Reed, Stable skew partition problem, Discrete Applied Mathematics 143 (2004), pp. 17-22.
9. R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness II: On completeness for W[1], Theoretical Computer Science 141 (1995), pp. 109-131.
10. R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness III: Some structural aspects of the W hierarchy, in: Complexity Theory: Current Research, Cambridge University Press (1993), pp. 191-226.
11. R. G. Downey and M. R. Fellows, Parameterized Complexity, Springer-Verlag, New York, NY, 1999.
12. T. Feder and P. Hell, List constraint satisfaction and list partition, submitted.
13. T. Feder and P. Hell, Matrix partitions of perfect graphs, submitted.
14. T. Feder, P. Hell, and J. Huang, Bi-arc graphs and the complexity of list homomorphisms, J. Graph Theory 42 (1999), pp. 61-80.
15. T. Feder, P. Hell, S. Klein, and R. Motwani, List partitions, SIAM J. Discrete Math. 16 (2003), pp. 449-478.
16. T. Feder, P. Hell, and K. Tucker-Nally, List partitions and trigraph homomorphisms, submitted.
17. C. M. H. de Figueiredo, S. Klein, Y. Kohayakawa, and B. Reed, Finding skew partitions efficiently, Journal of Algorithms 37 (2000), pp. 505-521.
18. P. Hell and J. Nešetřil, Graphs & homomorphisms, Oxford University Press, Oxford, UK, 2004.