Monadic second order logic on graphs with local cardinality constraints

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

Volumn 5162 LNCS, Issue , 2008, Pages 601-612

  Szeider, Stefan ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; FORMAL LOGIC; FOUNDATIONS; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

BOUNDED TREEWIDTH; GRAPH G; LOCAL CARDINALITY; NEGATIVE INTEGERS; POLYNOMIAL TIMES; SECOND ORDERS;

SET THEORY;

EID: 54249096048     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85238-4_49     Document Type: Conference Paper

References (20)

1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308-340 (1991)
2. Asahiro, Y., Miyano, E., Ono, H.: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. In: Proceedings of CATS 2008, Computing: The Australasian Theory Symposium. Conferences in Research and Practice in Information Technology, vol. 77, pp. 97-106. Australian Computer Society (2008)
3. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305-1317 (1996)
4. Bodlaender, H.L.: A partial κ-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209(1-2), 1-45 (1996)
5. Bodlaender, H.L., Fomin, F.V.: Equitable colorings of bounded treewidth graphs. In: Fiala, J., Koubek, V., Kratochvil, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 180-190. Springer, Heidelberg (2004); Theoret. Comput. Sci. 349(1), pp. 22-30, (Full version published, 2005)
6. Cornuéjols, G.: General factors of graphs. J. Combin. Theory Ser. B 45(2), 185-198 (1988)
7. Courcelle, B.: Recognizabifity and second-order definability for sets of finite graphs. Technical Report I-8634, Université de Bordeaux (1987)
8. Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: Handbook of theoretical computer science, vol. B, pp. 193-242. Elsevier Science Publishers, North-Holland, Amsterdam (1990)
9. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
10. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
11. Kloks, T.: Treewidth: Computations and Approximations. Springer, Heidelberg (1994)
12. Kostochka, A.V., Nakprasit, K., Pemmaraju, S.V.: On equitable coloring of d-degenerate graphs. SLAM J. Discrete Math. 19(1), 83-95 (2005)
13. Lih, K.-W.: The equitable coloring of graphs. In: Handbook of combinatorial optimization, vol. 3, pp. 543-566. Kluwer Academic Publishers, Dordrecht (1998)
14. Lovász, L.: The factorization of graphs. In: Combinatorial Structures and their Applications (Proc. Calgary Internal. Conf., Calgary, Alta., 1969), pp. 243-246. Gordon and Breach, New York (1970)
15. Lovász, L.: The factorization of graphs. II. Acta Math. Acad. Sci. Hungar. 23, 223-246 (1972)
16. Meyer, W.: Equitable coloring. Amer. Math. Monthly 80, 920-922 (1973)
17. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
18. Rose, D. J.: On simple characterizations of κ-trees. Discrete Math. 7, 317-322 (1974)
19. Samer, M., Szeider, S.: Tractable cases of the extended global cardinality constraint. In: Proceedings of CATS 2008, Computing: The Australasian Theory Symposium. Conferences in Research and Practice in Information Technology, vol. 77, pp. 67-74. Australian Computer Society (2008)
20. Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory 2, 57-81 (1968)