MSO queries on tree decomposable structures are computable with linear delay

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

Volumn 4207 LNCS, Issue , 2006, Pages 167-181

  Bagan, Guillaume ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; PROBLEM SOLVING; TREES (MATHEMATICS);

LINEAR DELAY; LINEAR TIME; TREE AUTOMATON; TREE DECOMPOSABLE STRUCTURES;

QUERY LANGUAGES;

EID: 33750320810     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11874683_11     Document Type: Conference Paper

References (15)

1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms. Addison-Wesley Series in Computer Science and Information Processing. Addison-Wesley, 1982.
2. Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12(2):308-340, 1991.
3. Hans L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1-21, 1993.
4. Hans L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6):1305-1317, 1996.
5. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997. release October, Irst 2002.
6. Bruno Courcelle. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pages 193-242. 1990.
7. Bruno Courcelle. Linear delay enumeration and monadic second-order logic, 2006. Submitted.
8. Bruno Courcelle and Mohamed Mosbah. Monadic second-order evaluations on tree-decomposable graphs. Theor. Comput Sci., 109(1&2):49-82, 1993.
9. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
10. Arnaud Durand and Etienne Grandjean. First-order queries on structures of bounded degree are computable with constant delay. Transactions on Computational Logic, To appear.
11. Jörg Flum, Markus Frick. and Martin Grohe. Query evaluation via tree-decompositions. J. ACM, 49(6):716-752, 2002.
12. Etienne Grandjean and Frédéric Olive. Graph properties checkable in linear time in the number of vertices. J. Comput. Syst. Sci., 68(3):546-597, 2004.
13. Etienne Grandjean and Thomas Schwentick. Machine-independent characterizations and complete problems for deterministic linear time. SIAM J. Comput., 32(1):196-230, 2002.
14. Leonid Libkin. Elements of finite model theory. Springer, 2004. LIB 1 04:1 1.Ex.
15. James W. Thatcher and Jesse B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57-81, 1968.