✦ LIBER ✦

Partitioning Graphs of Bounded Tree-Width

✍ Scribed by Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan

Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 199 KB
Volume: 18
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004930050001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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.

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

Bounded Tree-Width and LOGCFL

✍ E. Wanke 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 902 KB

We show that (1) the recognition of tree-width bounded graphs and (2) the decidability of graph properties--which are defined by finite equivalence relations on \(h\)-sourced graphs-on tree-width bounded graphs belong to the complexity class LOGCFL. This is the lowest complexity class known for thes

Tree-width and circumference of graphs

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

Quotient tree partitioning of undirected

Quotient tree partitioning of undirected graphs

✍ Anders Edenbrandt 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 433 KB