✦ LIBER ✦

Constrained-Path Labellings on Graphs of Bounded Clique-Width

✍ Scribed by Bruno Courcelle; Andrew Twigg

Book ID: 105915105
Publisher: Springer
Year: 2009
Tongue: English
Weight: 961 KB
Volume: 47
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-009-9211-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Graph Classes of Bounded Clique-Widt

New Graph Classes of Bounded Clique-Width

✍ Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Raffaele Mosca 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 477 KB

Chordal bipartite graphs of bounded tree

Chordal bipartite graphs of bounded tree- and clique-width

✍ V. Lozin; D. Rautenbach 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Linear Time Solvable Optimization Proble

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width

✍ B. Courcelle; J. A. Makowsky; U. Rotics 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 150 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

Farrell polynomials on graphs of bounded

Farrell polynomials on graphs of bounded tree width

✍ J.A. Makowsky; J.P. Mariño 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 149 KB

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.