On Interval Routing Schemes and treewidth
In this paper, we investigate which processor networks allow k-label Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each fixed k≥1, the class of graphs allowing such routing schemes is closed under minor-taking in the domain of connected graphs, and hence has a linear time recognition algorithm. This result connects the theory of compact routing with the theory of graph minors and treewidth.
We also show that every graph that does not contain K2, r as a minor has treewidth at most 2r−2. In case the graph is planar, this bound can be lowered to r+2. As a consequence, graphs that allow k-label Interval Routing Schemes under dynamic cost edges have treewidth at most 4k, and treewidth at most 2k+3 if they are planar.
Similar results are shown for other types of Interval Routing Schemes.
Unable to display preview. Download preview PDF.
- 2.E. M. Bakker, R. B. Tan and J. van Leeuwen. Linear interval routing schemes. Algorithms Review, 2:45–61, 1991.Google Scholar
- 3.E. M. Bakker, R. B. Tan and J. van Leeuwen. Manuscript, 1994.Google Scholar
- 4.D. Bienstock, N. Robertson, P. D. Seymour, and R. Thomas. Quickly excluding a forest. J. Comb. Theory Series B, 52:274–283, 1991.Google Scholar
- 5.H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Proceedings of the 25th Annual Symposium on Theory of Computing, pages 226–234, New York, 1993. ACM Press. To appear in SIAM J. Comput.Google Scholar
- 6.H. L. Bodlaender. On linear time minor tests with depth first search. J. Algorithms, 14:1–23, 1993.Google Scholar
- 7.H. L. Bodlaender. On disjoint cycles. Int. J. Found. Computer Science, 5(1):59–68, 1994.Google Scholar
- 8.H. L. Bodlaender and R. H. Möhring. The pathwidth and treewidth of cographs. SIAM J. Disc. Math., 6:181–188, 1993.Google Scholar
- 9.B. Bollobas. Random Graphs. Academic Press, London, 1985.Google Scholar
- 11.M. R. Fellows and M. A. Langston. On search, decision and the efficiency of polynomial-time algorithms. J. Comp. Syst. Sc., 49:769–779, 1994.Google Scholar
- 13.Inmos. The T9000 Transputer Products Overview Manual, 1991.Google Scholar
- 14.T. Kloks. Treewidth. Computations and Approximations. Lecture Notes in Computer Science, Vol. 842. Springer Verlag, Berlin, 1994.Google Scholar
- 15.J. van Leeuwen and R. B. Tan. Computer networks with compact routing tables. In G. Rozenberg and A. Salomaa, editors, The Book of L, pages 298–307. Springer-Verlag, Berlin, 1986.Google Scholar
- 16.A. Parra. Personal communication, 1995.Google Scholar
- 17.N. Robertson and P. D. Seymour. Graph minors — a survey. In I. Anderson, editor, Surveys in Combinatorics, pages 153–171. Cambridge Univ. Press, 1985.Google Scholar
- 19.N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Series B, 63:65–110, 1995.Google Scholar
- 20.N. Robertson, P. D. Seymour, and R. Thomas. Quickly excluding a planar graph. Technical Report TR89-16, DIMACS, 1989.Google Scholar
- 22.R. B. Tan and J. van Leeuwen. Compact routing methods: A survey. Technical Report UU-CS-1995-05, Department of Computer Science, Utrecht University, Utrecht, 1995.Google Scholar