An O*(2n) algorithm for graph coloring and other partitioning problems via inclusion-exclusion

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 583-590

  Koivisto, Mikko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

GRAPH COLORING; GRAPH PARTITIONING PROBLEMS; INCLUSION-EXCLUSION; MÖBIUS TRANSFORM;

APPROXIMATION ALGORITHMS;

EID: 38749119020     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.11     Document Type: Conference Paper

References (31)

1. J. D. Banfield and A. E. Raftery. Model-based Gaussian and non Gaussian clustering. Biometrics, 49:803-821, 1993.
2. E. T. Bax. Inclusion and exclusion algorithm for the Hamiltonian path problem. Information Processing Letters, 47(4):203-207, 1993.
3. E. T. Bax. Algorithms to count paths and cycles. Information Processing Letters, 52(5):249-252, 1994.
4. E. T. Bax and J. Franklin. A finite-difference sieve to count paths and cycles by length. Information Processing Letters, 60(4):171-176, 1996.
5. n) time. Journal of Algorithms, 54:168-204, 2005.
6. A. Björklund and T. Husfeldt. Exact algorithms for exact satisfiability and number of perfect matchings. In Proceedings of the 33 rd International Colloquium on Automata, Languages and Programming (ICALP 2006), LNCS 4051, pages 548-559. Springer, 2006.
7. A. Björklund and T. Husfeldt. Inclusion-exclusion algrithms for counting set partitions. In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS 2006). 2006. these proceedings.
8. H. L. Bodlaender and D. Kratsch. An exact algorithm for graph coloring with polynomial memory. Technical Report UU-CS-2006-015, Utrecht University, 2006.
9. J. M. Byskov. Exact Algorithms for Graph Colouring and Exact Satisfiability. PhD thesis, University of Aarhus, August 2005.
10. D. M. Chickering, D. Heckerman, and C. Meek. A Bayesian approach to learning Bayesian networks with local structure. In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI 1997), pages 80-89, 1997.
11. D. Eppstein. Small maximal independent sets and faster exact graph coloring. J. Graph Algorithms Appl., 7(2): 131-140, 2003.
12. M. A. T. Figueiredo and A. K. Jain. Unsupervised learning of finite mixture models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(3): 381-396, 2002.
13. F. V. Fomin, A. V. P. F. Grandoni, and A. A. Stepanov. Bounding the number of minimal dominating sets: A measure and conquer approach. In Algorithms and Computation: 16th International Symposium (ISAAC 2005), LNCS 3827, pages 573-582. Springer, 2006.
14. M. Garey and D. Johnson. Computers and Intractability - A Guide to the Theory of NP-completeness. W. H. Freeman & Co., San Fransisco, CA, 1979.
15. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31(3):264-323, 1999.
16. R. M. Karp. Dynamic programming meets the principle of inclusion and exclusion. Operations Research Letters, 1(2):49-51, 1982.
17. R. Kennes. Computational aspects of the Moebius transform of a graph. IEEE Transactions on Systems, Man, and Cybernetics, 22:201-223, 1991.
18. M. Koivisto. Sum-Product Algorithms for the Analysis of Genetic Risks. PhD thesis, University of Helsinki, January 2004.
19. M. Koivisto. Optimal 2-constraint satisfaction via sum-product algorithms. Information Processing Letters, 98(1):24-28, 2006.
20. M. Koivisto and K. Sood. Exact Bayesian structure discovery in Bayesian networks. Journal of Machine Learning Research, 5:549-573, 2004.
21. M. Koivisto and K. Sood. Computational aspects of Bayesian partition models. In International Conference on Machine Learning (ICML 2005), pages 433-440, 2005.
22. E. Lawler. A note on the complexity of the chromatic number problem. Information Processing Letters, 5:66-67, 1976.
23. F. A. Quintana and P. L. Iglesias. Bayesian clustering and product partition models. Journal of the Royal Statistical Society B, 65(2):557-574, 2003.
24. L. R. Rabiner. A tutorial on Hidden Markov Models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257-286, 1989.
25. n algorithm for the three domatic number problem. In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), pages 733-744, 2005.
26. T. Riege, J. Rothe, H. Spakowski, and M. Yamamoto. An improved exact algorithm for the domatic number problem. In Proceedings of the Second IEEE International Conference on Information & Communication Technologies: From Theory to Applications (ICTTA), pages 1021-1022, 2006.
27. H. J. Ryser. Combinatorial Mathematics. Carus Math. Monographs, No. 14, Wiley, New York, 1963.
28. A. Schönhage and V. Strassen. Schnelle Multiplikation großer Zahlen. Computing, 7:281-292, 1971.
29. R. Williams. A new algorithm for optimal 2-constraint satisfaction and its implications. Theoretical Computer Science, 348(2-3):257-265, 2005.
30. G. J. Woeginger. Exact algorithms for NP-hard problems: a survey. In Combinatorial optimization - eureka, you shrink!, LNCS 3142, pages 185-207. Springer, 2003.
31. G. J. Woeginger. Space and time complexity of exact algorithms: Some open problems. In Proceedings of the First International Workshop on Parametrized and Exact Computation (IWPEC 2004), LNCS 3162, pages 281-290. Springer, 2004.