Dynamie algorithms for graphs of bounded Treewidth

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

Volumn 1256, Issue , 1997, Pages 293-302

  Hagerup, Torben ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

ANSWERING QUERIES; BOUNDED TREEWIDTH; DYNAMIC PROBLEM; EDGE LABELS; SECOND ORDERS; SEMI-GROUP; STATIC PROBLEMS;

TREES (MATHEMATICS);

EID: 84951102956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. Alon, N., and Schieber, B. (1987), Optimal preprocessing for answering on-line product queries, Tech. Rep. No. 71/87, Tel Aviv University.
2. Arikati, S. R., Chaudhuri, S., and Zaroliagis, CD. (1995), All-pairs min-cut in sparse networks, in Proc. 15th Conference on Foundations of Software Technology and Theoretical Computer Science (FST& TCS), Springer Lecture Notes in Computer Science, Vol. 1026, pp. 363-376.
3. Arnborg, S., Lagergren, J., and Seese, D. (1991), Easy problems for tree-decomposable graphs, J. Algorithms 12, pp. 308-340.
4. Bern, M. W., Lawler, E. L., and Wong, A. L. (1987), Linear-time computation of optimal subgraphs of decomposable graphs, J. Algorithms 8, pp. 216-235.
5. Bodlaender, H. L. (1993a), On reduction algorithms for graphs with small treewidth, in Proc. 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Springer Lecture Notes in Computer Science, Vol. 790, pp. 45-56.
6. Bodlaender, H. L. (1993b), Dynamic algorithms for graphs with treewidth 2, in Proc. 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Springer Lecture Notes in Computer Science, Vol. 790, pp. 112-124.
7. Bodlaender, H. L. (1996a), A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25, pp. 1305-1317.
8. Bodlaender, H. L. (1996b), A partial fe-arboretum of graphs with bounded treewidth, Tech. Rep. No. UU-CS-1996-02, Dept. of Computer Science, Utrecht University.
9. Borie, R. B., Parker, R. G., and Tovey, C. A. (1992), Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Aigorithmica 7, pp. 555-581.
10. Chaudhuri, S., and Zaroliagis, CD. (1995), Shortest path queries in digraphs of small treewidth, Proc. 22nd International Colloquium on Automata, Languages and Programming (ICALP), Springer LNCS, Vol. 944, pp. 244-255.
11. Chazelle, B. (1987), Computing on a free tree via complexity-preserving mappings, Aigorithmica 2, pp. 337-361.
12. Courcelle, B. (1990a), Graph rewriting: An algebraic and logic approach, in Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics (J. van Leeuwen, ed.), Chap. 5, pp. 193-242, Elsevier, Amsterdam.
13. Courcelle, B. (1990b), The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Inform, and Comput. 85, pp. 12-75.
14. Courcelle, B., and Mosbah, M. (1993), Monadic second-order evaluations on tree-decomposable graphs, Theor. Comput. Sci. 109, pp. 49-82.
15. Harel, D., and Tarjan, R. E. (1984), Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13, pp. 338-355.
16. Radhakrishnan, V., Hunt, H B., and Stearns, R. E. (1992), Efficient algorithms for solving systems of linear equations and path problems, Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science (STAGS), Springer Lecture Notes in Computer Science, Vol. 577, pp. 109-119.
17. Robertson, N., and Seymour, P. D. (1986), Graph Minors. II. Algorithmic aspects of tree-width, J. Algorithms 7, pp. 309-322.
18. Schieber, B., and Vishkin, U. (1988), On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput. 17, pp. 1253-1262.
19. Stearns, R. E., and Hunt, H. B. (1996), An algebraic model for combinatorial problems, SIAM J. Comput. 25, pp. 448-476.
20. van Leeuwen, J. (1990), Graph algorithms, in Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity (J. van Leeuwen, ed.), Chap. 10, pp. 525-631, Elsevier, Amsterdam.