𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reduction Algorithms for Graphs of Small Treewidth

✍ Scribed by Hans L Bodlaender; Babette van Antwerpen-de Fluiter

Book ID
112252554
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
249 KB
Volume
167
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient and Constructive Algorithms fo
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
✍ Hans L. Bodlaender; Ton Kloks πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 373 KB

In this paper we give, for all constants k, l, explicit algorithms that, given a graph Ε½ . Gs V,E with a tree-decomposition of G with treewidth at most l, decide Ε½ . whether the treewidth or pathwidth of G is at most k, and, if so, find a Ε½ . tree-decomposition or path-decomposition of G of width at

Algorithms for graphs with small octopus
Algorithms for graphs with small octopus
✍ Fedor V. Fomin; Dieter Kratsch; Haiko MΓΌller πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 376 KB

A d-octopus of a graph G = (V; E) is a subgraph T = (W; F) of G such that W is a dominating set of G, and T is the union of d (not necessarily disjoint) shortest paths of G that have one endpoint in common. First, we study the complexity of ΓΏnding and approximating a d-octopus of a graph. Then we sh