MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay-Reference-Cited by-同舟云学术

MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay

Published:2006 Issue: Volume: Page:167-181
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Bagan Guillaume

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11874683_11.pdf

Reference15 articles.

1. Addison-Wesley Series in Computer Science and Information Processing;A.V. Aho,1982

2. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991)

3. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1–21 (1993)

4. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)

5. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997) (release October 1, 2002) available on: http://www.grappa.univ-lille3.fr/tata

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enumeration for MSO-Queries on Compressed Trees;Proceedings of the ACM on Management of Data;2024-05-10

2. Dynamic treewidth;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries;Logical Methods in Computer Science;2023-08-09

4. Efficient Enumeration for Annotated Grammars;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12

5. Enumeration for FO Queries over Nowhere Dense Graphs;Journal of the ACM;2022-06-11