✦ LIBER ✦

Graph minors. II. Algorithmic aspects of tree-width

✍ Scribed by Neil Robertson; P.D Seymour

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 734 KB
Volume: 7
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(86)90023-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ka,k Minors in Graphs of Bounded Tree-Wi

Ka,k Minors in Graphs of Bounded Tree-Width

✍ Thomas Böhme; John Maharry; Bojan Mohar 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 175 KB

It is shown that for any positive integers k and w there exists a constant N ¼ N ðk; wÞ such that every 7-connected graph of tree-width less than w and of order at least N contains K 3;k as a minor. Similar result is proved for K a;k minors where a is an arbitrary fixed integer and the required conn

Algorithmic Aspects of Tree Amalgamation

✍ Sebastian Böcker; David Bryant; Andreas W.M. Dress; Mike A. Steel 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 129 KB

The amalgamation of leaf-labeled trees into a single (super)tree that "displays" each of the input trees is an important problem in classification. We discuss various approaches to this problem and show that a simple and well-known polynomialtime algorithm can be used to solve this problem whenever

Efficient Parallel Algorithms for Graphs

Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

✍ Jens Lagergren 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We present an efficient parallel algorithm for the tree-decomposition problem Ž 3 . Ž. for fixed width w. The algorithm runs in time O O log n and uses O O n processors on an ARBITRARY CRCW PRAM. The sequential complexity of our tree-decom-Ž 2 . position algorithm is O O n log n . The tree-decomposi

Tree-width and circumference of graphs

✍ Etienne Birmele 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 37 KB

Multiplicities of Eigenvalues and Tree-W

Multiplicities of Eigenvalues and Tree-Width of Graphs

✍ Yves Colin de Verdière 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 567 KB

Using multiplicities of eigenvalues of elliptic self-adjoint differential operators on graphs and transversality, we construct some new invariants of graphs which are related to tree-width.

Optimal Parametric Search on Graphs of B

Optimal Parametric Search on Graphs of Bounded Tree-Width

✍ David Fernández-Baca; Giora Slutzki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 339 KB

We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate parametric search on planar graphs.