✦ LIBER ✦

Trimming weighted graphs of bounded treewidth

✍ Scribed by David Knipe

Book ID: 113564657
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 315 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.07.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recoloring bounded treewidth graphs

✍ Bonamy, Marthe; Bousquet, Nicolas 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 185 KB

On bounded treewidth duality of graphs

✍ Ne?et?il, Jaroslav; Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 734 KB

For a graph H , the H-coloring problem is to decide whether or not an instance graph G is homomorphic to H . The H-coloring problem is said to have bounded treewidth duality if there is an integer k such that for any graph G which is not homomorphic to H , there is a graph F of treewidth k which is

Dynamic Algorithms for Graphs of Bounded

Dynamic Algorithms for Graphs of Bounded Treewidth

✍ T. Hagerup 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 181 KB

Channel assignment on graphs of bounded

Channel assignment on graphs of bounded treewidth

✍ Colin McDiarmid; Bruce Reed 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Lower bounds for treewidth of product gr

Lower bounds for treewidth of product graphs

✍ Kozawa, Kyohei; Otachi, Yota; Yamazaki, Koichi 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 416 KB

I/O-Efficient Algorithms for Graphs of B

I/O-Efficient Algorithms for Graphs of Bounded Treewidth

✍ Anil Maheshwari; Norbert Zeh 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 976 KB