On interval routing schemes and treewidth
type: Item
instance of: scholarly article
title: On interval routing schemes and treewidth
zbMATH Open document ID: 0892.68069
author: J. Van Leeuwen
author: Dimitrios M. Thilikos
author: Hans L. Bodlaender
author: Richard B. Tan
published in: Information and Computation
publication date: 1998-06-15T00:00:00Z
full work available at URL: https://dspace.library.uu.nl/handle/1874/18307
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1138500
zbMATH Keywords: interval routing schemes
MaRDI profile type: Publication
OpenAlex ID: W2102159495
cites work: Easy problems for tree-decomposable graphs
cites work: Quickly excluding a forest
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: On Linear Time Minor Tests with Depth-First Search
cites work: ON DISJOINT CYCLES
cites work: The Pathwidth and Treewidth of Cographs
cites work: Q3682518
cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Nonconstructive tools for proving polynomial-time decidability
cites work: On search, decision, and the efficiency of polynomial-time algorithms
cites work: Designing networks with compact routing tables
cites work: Treewidth. Computations and approximations
cites work: Q3711761
cites work: Q3684139
cites work: Graph minors. V. Excluding a planar graph
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Quickly excluding a planar graph
cites work: Labelling and Implicit Routing in Networks
DOI: 10.1006/INCO.1997.2669
description: scientific article; zbMATH DE number 1138500