On Interval Routing Schemes and treewidth

DOI10.1007/3-540-60618-1_75OpenAlexW1541520143MaRDI QIDQ6122222

Unnamed Author, Hans L. Bodlaender, Jan van Leeuwen, Dimitrios M. Thilikos

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/18307

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Designing networks with compact routing tables
• Quickly excluding a forest
• Treewidth. Computations and approximations
• On search, decision, and the efficiency of polynomial-time algorithms
• Graph minors. XIII: The disjoint paths problem
• Labelling and Implicit Routing in Networks
• Easy problems for tree-decomposable graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Nonconstructive tools for proving polynomial-time decidability
• On Linear Time Minor Tests with Depth-First Search
• ON DISJOINT CYCLES
• The Pathwidth and Treewidth of Cographs
• A linear time algorithm for finding tree-decompositions of small treewidth

This page was built for publication: On Interval Routing Schemes and treewidth