On Interval Routing Schemes and Treewidth

Information and Computation

Volumn 139, Issue 1, 1997, Pages 92-109

  Bodlaender, Hans L ^a   Van Leeuwen, Jan ^a   Tan, Richard ^a,b   Thilikos, Dimitrios M ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b University of Science and Arts of Oklahoma   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002004104     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2669     Document Type: Article

References (24)

1. Arnborg, S., Lagergren, J., and Seese, D. (1991), Easy problems for tree-decomposable graphs, J. Algorithms 12, 308-340.
2. Bakker, E. M., van Leeuwen, J. and Tan, R. B. (1991), Linear interval routing schemes, Algorithms Rev. 2, 45-61.
3. Bienstock, D., Robertson, N., Seymour, P. D., and Thomas, R. (1991), Quickly excluding a forest, J. Combin. Theory Ser. B 52, 274-283.
4. Bodlaender, H. L. (1996), A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25, 1305-1317.
5. Bodlaender, H. L. ((1993), On linear time minor tests with depth first search, J. Algorithms 14, 1-23.
6. Bodlaender, H.L. (1994), On disjoint cycles, Int. J. Found. Comput. Sci. 5 (1), 59-68.
7. Bodlaender, Hans L., van Leeuwen, Jan, Tan, Richard, and Thilikos, Dimitrios (1996), (1996), "On Interval Routing Schemes and Treewidth," Technical Report UU-CS-1996-41, Department of Computer Science, Utrecht University, Utrecht. Available ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/ CS-1996/1996-41.ps.gz
8. Bodlaender, H. L., and Möhring, R. H. (1993), The pathwidth and treewidth of cographs, SIAM J. Discrete Method 6, 181-188.
9. Bollobas, B. (1985), "Random Graphs," Academic Press, London,.
10. 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, Algorithmica 7, 555-581.
11. Cormen, T. H., Leiserson, C. C., and Rivest, R. L. (1989), "Introduction to Algorithms," MIT Press, Cambridge, MA.
12. Courcelle, B. (1990), The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Inform. and Comput. 85, 12-75.
13. Fellows, M. R., and Langston, M. A. (1988), Nonconstructive tools for proving polynomial-time decidability, J. Assoc. Comput. Mach. 35 727-739.
14. Fellows, M. R., and Langston, M. A. (1994), On search, decision and the efficiency of polynomial-time algorithms, J. Comput. System. Sci. 49, 769-779.
15. Frederickson, G. N., and Janardan, R. (1988), Designing networks with compact routing tables, Algorithmica 3, 171-190, 1988.
16. Inmos. (1991), "The T9000 Transputer Products Overview Manual."
17. Kloks, T. (1994), "Treewidth. Computations and Approximations," Lecture Notes in Computer Science," Vol. 842, Springer-Verlag, Berlin/New York.
18. van Leeuwen, J., and Tan, R. B. (1986), Computer networks with compact routing tables, in "The Book of L" (G. Rozenberg and A. Salomaa, Ed.), pp. 298-307, Springer-Verlag, Berlin.
19. van Leeuwen, J., and Tan, R. B. Compact routing methods: A survey, in "Proceedings, Colloquium on Structural Information and Communication Complexity (SIROCCO'94), School of Computer Science, Carleton University, Ottawa, 99-109.
20. Robertson, N., and Seymour, P. D. (1985), Graph minors - A survey, in "Surveys in Combinatorics" (I. Anderson, Ed.), pp. 153-171, Cambridge Univ. Press, Cambridge, UK.
21. Robertson, N., and Seymour, P.D. (1986), Graph minors. V. Excluding a planar graph, J. Combin. Theory Ser. B 41, 92-114.
22. Robertson, N., and Seymour, P. D. (1995), Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B 63, 65-110.
23. Robertson, N., Seymour, P. D., and Thomas, R. (1994), Quickly excluding a planar graph, J. Combin. Theory Ser. B 62, 323-348.
24. Santoro, N., and Khatib, R. (1985), Labelling and implicit routing in networks, Comput. J. 28, 5-8.