✦ LIBER ✦

Two feedback problems for graphs with bounded tree-width

✍ Scribed by Shaoqiang Zhang; Guojun Li; Moo-Young Sohn

Book ID: 107500688
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2004
Tongue: English
Weight: 292 KB
Volume: 19
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-004-0048-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Layout of Graphs with Bounded Tree-Width

✍ Dujmovic, Vida; Morin, Pat; Wood, David R. 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 328 KB

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

Minimum cycle cover and Chinese postman

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

✍ Cristina G. Fernandes; Orlando Lee; Yoshiko Wakabayashi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 546 KB

On the OBDD size for graphs of bounded t

On the OBDD size for graphs of bounded tree- and clique-width

✍ Klaus Meer; Dieter Rautenbach 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 528 KB

On the Band-, Tree-, and Clique-Width of

On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree

✍ Lozin, V.; Rautenbach, D. 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 178 KB

New heuristics for two bounded-degree sp

New heuristics for two bounded-degree spanning tree problems

✍ Shyam Sundar; Alok Singh; André Rossi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 640 KB