Bounded persistence pathwidth

Conferences in Research and Practice in Information Technology Series

Volumn 41, Issue , 2005, Pages

  Downey, Rodney G ^a   McCartin, Catherine ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b MASSEY UNIVERSITY   (New Zealand)

Author keywords

Bounded Persis tence Pathwidth; Parameterized complexity; Pathwidth; Treewidth

Indexed keywords

ALGORITHM DESIGN; BASIC RESULTS; CLIQUE-WIDTH; PARAMETERIZED COMPLEXITY; PATH DECOMPOSITION; PATHWIDTH; TREE-WIDTH; UNDERLYING GRAPHS;

COMPUTATION THEORY;

GRAPH THEORY;

EID: 84864011429     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Arnborg, S., Corneil, D. G. & Proskurowski, A. (1987), Complexity of finding embeddings in a k-tree, SIAM J. Alg. Disc. Meth. 8, pp. 277-284.
2. Bodlaender, H.L. (1996), A linear time algorithm for finding tree decompositions of small treewidth, SIAM J. Comput. 25, pp. 1305-1317.
3. Bodlaender, H.L. (1996a), A partial k-arboretum of graphs with bounded treewidth, Technical Re- port UU-CS-1996-02, Department of Computer Science, Utrecht University, Utrecht.
4. Bodlaender, H.L. (1997), Treewdith: Algorithmic techniques and results, in Proceedings of 22nd MFCS, Springer-Verlag LNCS 1295, pp. 19-36.
5. Bodlaender, H. L. & Engelfreit, J. (1997), Domino Treewidth, J. Algorithms 24, pp. 94-127.
6. Bodlaender, H. L., Fellows, M. R. & Hallett, M. T. (1994), Beyond NP-completeness for problems of bounded width: Hardness for the W-hierarchy, in Proceedings of 26th Annual Symposium on Theory of Computing, ACM Press, New York, pp. 449-458.
7. Bodlaender, H. L. & Kloks, T. (1996), Efficient and constructive algorithms for the pathwidth and treewdith of graphs, J. Algorithms 21, pp. 358- 402.
8. Downey, R. G. & Fellows, M. R. (1999), Parameter- ized Complexity, Springer-Verlag.
9. Downey, R. G. & McCartin, C. M. (2004), Online Problems, Pathwidth, and Persistence, in Pro- ceedings of IWPEC 2004, Springer-Verlag LNCS 3162, pp. 13-24.
10. de Fluiter, B. (1997), Algorithms for Graphs of Small Treewidth, ISBN 90-393-1528-0.
11. Fellows, M. R. & Langston, M. A. (1989), An ana- logue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations, in Proceedings of the 30th Annual Symposium on Foundations of Computer Science, IEEE Com- puter Science Press, Los Alamitos, California, pp. 520-525.
12. Lagergren, J. (1996), Efficient parallel algorithms for graphs of bounded treewidth, J. Algorithms 20, pp. 20-44.
13. Matousek, J. & Thomas, R. (1991), Algorithms for finding tree-decompositions of graphs, J. Algo- rithms 12, pp. 1-22.
14. McCartin, C. (2003), Contributions to Parameterized Complexity, Ph.D., Victoria University, Welling- ton.
15. Perkovic, L. & Reed, B. (2000), An Improved Algo- rithm for Finding Tree Decompositions of Small Width, International Journal of Foundations of Computer Science 11 (3), pp. 365-371.
16. Reed, B. (1992), Finding approximate separators and computing treewdith quickly, in Proceedings of the 24th Annual Symposium on Theory of Com- puting, ACM Press, New York, pp. 221-228.
17. Robertson, N. & Seymour, P. D. (1986), Graph mi- nors II. Algorithmic aspects of tree-width, J. Al- gorithms 7, pp. 309-322.
18. Robertson, N. & Seymour, P. D. (1985), Graph minors - a survey, in I. Anderson ed, 'Sur- veys in Combinatorics', Cambridge Univ. Press, pp. 153-171.