Algorithms and obstructions for linear-width and related search parameters

Discrete Applied Mathematics

Volumn 105, Issue 1-3, 2000, Pages 239-271

  Thilikos, Dimitrios M ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Graph algorithm; Graph minor; Graph searching; Linear width; Obstruction set

Indexed keywords

EID: 0012528897     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00175-X     Document Type: Article

References (40)

1. Arnborg S., Proskurowski A., Corneil D.G. Forbidden minors characterization of partial 3-trees. Discrete Math. 80:1990;1-19.
2. Bienstock D., Dean N. On obstructions to small face covers in planar graphs. J. Combin. Theory Ser. B. 55:1992;163-189.
3. Bienstock D., Seymour P. Monotonicity in graph searching. J. Algorithms. 12:1991;239-245.
4. Bodlaender H.L., Tan R.B., Thilikos D.M., van Leeuwen J. On interval routing schemes and treewidth. Inform. Comput. 139(1):1997;92-109.
5. Bodlaender H.L. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25:1996;1305-1317.
6. Bodlaender H.L., Kloks T. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms. 21:1996;358-402.
7. H.L. Bodlaender, D.M. Thilikos, Computing small search numbers in linear time, Report No. UU-CS-1998-05, Dept. of Computer Science, Utrecht University, 1998. http://www.lsi.upc.es/ ̃sedthilk/trunk.ps .
8. Bodlaender H.L., Thilikos D.M. Graphs with branchwidth at most three. J. Algorithms. 32:1999;167-194.
9. Breisch R. An intuitive approach to speleotopology. A publication of the Southwestern Region of the National Speleological Society. VI:1967;72-78.
10. Chartrand G., Harary F. Planar permutation graphs. Ann. Inst. Henri Poincarè 3:1967;433-438.
11. Chartrand G., Lesniak L. Graphs & Digraphs. 3rd Edition:1996;Chapman & Hall, London.
12. B. de Fluiter, Algorithms for graphs of small treewidth, Ph.D. Thesis, Dept. Computer Science Utrecht University, 1997.
13. Dendris N.D., Kirousis L.M., Thilikos D.M. Fugitive-search games on graphs and related parameters. Theoret. Comput. Sci. 172(1-2):1997;233-254.
14. Ellis J.A., Sudborough I.H., Turner J. The vertex separation and search number of a graph. Inform. Comput. 113:1994;50-79.
15. Fellows M.R., Kinnersley N.G., Langston M.A. Finite-basis theorems, and a computational integrated approach to obstruction set isolation. Kaltofen E., Watt S.M. Proceedings of the third Conference on Computers and Mathematics. 1989;37-45 Springer, New York.
16. Fellows M.R., Langston M.A. Nonconstructive tools for proving polynomial-time decidability. J. ACM. 35:1988;727-739.
17. Fellows M.R., Langston M.A. On search, decision, and the efficiency of polynomial-time algorithms. J. Comput. Systems Sci. 49(3):1994;769-779.
18. Friedman H., Robertson N., Seymour P.D. The metamathematics of the graph minor theorem. Contemp. Math. 65:1978;229-261.
19. Harary F. Graph Theory. 1969;Addison-Wesley, Reading, MA.
20. Kajitani Y., Ishizuka A., Ueno S. A characterization of the partial. k -tree in terms of certain substructures Graphs Combin. 2:1986;233-246.
21. Kinnersley N.G. The vertex separation number of a graph equals its path width. Inform. Process Lett. 42:1992;345-350.
22. Kinnersley N.G., Kinnersley W.M. An efficient polynomial-time algorithm for three-track gate matrix layout. Comput. J. 37(5):1994;449-462.
23. Kinnersley N.G., Langston M.A. Obstruction set isolation for the gate matrix layout problem. Discrete Appl. Math. 54:1994;169-213.
24. Kirousis L.M., Papadimitriou C.H. Interval graphs and searching. Discrete Math. 55:1985;181-184.
25. Kirousis L.M., Papadimitriou C.H. Searching and pebbling. Theoret. Comput. Sci. 47:1986;205-218.
26. J. Lagergren, S. Arnborg, Finding minimal forbidden minors using a finite congruence, in: Proceedings of the 18th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 510, Springer, Berlin, 1991, pp. 532-543.
27. Megiddo N., Hakimi S.L., Garey M.R., Johnson D.S., Papadimitriou C.H. The complexity of searching a graph. J. ACM. 35:1988;18-44.
28. Möhring R.H. Graph problems related to gate matrix layout and PLA folding. Mayr E., Noltemeier H., Syslo M. Computational Graph Theory, Computing Suppl. 7. 1990;17-51 Springer, Berlin.
29. R. Motwani, A. Raghunathan, H. Saran, Constructive results from graph minors: Linkless embeddings, in: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988, pp. 398-407.
30. Parsons T.D. Pursuit evasion in a graph. Alavi Y., Lick D.R. Theory and Application of Graphs. 1976;426-441 Springer, Berlin.
31. Robertson N., Seymour P.D. Graph width and well-quasi ordering: a survey. Bondy J.A., Murty U.S.R. Progress in Graph Theory. 1984;399-406 Academic Press, Toronto.
32. Robertson N., Seymour P.D. Disjoint paths - a survey. SIAM J. Algebraic Discrete Methods. 6:1985;300-305.
33. N. Robertson, P.D. Seymour, in: Paths, Flows, and VLSI-Layout, Bonn, 1988, Springer, Berlin, 1990, 267-292.
34. Robertson N., Seymour P.D. Graph minors XIII. The disjoint paths problem. J. Combin. Theory Ser. B. 63:1995;65-110.
35. Satyanarayana A., Tung L. A characterization of partial 3-trees. Networks. 20:1990;299-322.
36. Y. Stamatiou, D.M. Thilikos, Monotonicity and inert fugitive search games, Report No. LSI-99-35-R, Departament de Llenguatges i Sistemes Informàtics, Universitat Polytècnica de Catalunya, 1999. http://www.lsi.upc.es/ ̃sedthilk/inert.ps .
37. Takahashi A., Ueno S., Kajitani Y. Minimal acyclic forbidden minors for the family of graphs with bounded path-width. Discrete Math. 127(1-3):1994;293-304.
38. Takahashi A., Ueno S., Kajitani Y. Minimal forbidden minors for the family of graphs with proper-path-width at most two. IEICE Trans. Fund. E78-A:1995;1828-1839.
39. Takahashi A., Ueno S., Kajitani Y. Mixed-searching and proper-path-width. Theoret. Comput. Sci. 137:1995;253-268.
40. R. Thomas, Tree-Decompositions of Graphs, Lecture Notes, School of Mathematics, Georgia Institute of Technology, 1996.