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.
CITATION STYLE
Bodlaender, H. L., Tan, R. B., Thilikos, D. M., & Van Leeuwen, J. (1995). On interval routing schemes and treewidth. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1017, pp. 181–196). Springer Verlag. https://doi.org/10.1007/3-540-60618-1_75
Mendeley helps you to discover research relevant for your work.