✦ LIBER ✦

Width Parameters Beyond Tree-width and their Applications

✍ Scribed by Hlineny, P.; Oum, S.-i.; Seese, D.; Gottlob, G.

Book ID: 118158104
Publisher: Oxford University Press
Year: 2007
Tongue: English
Weight: 634 KB
Volume: 51
Category: Article
ISSN: 0010-4620
DOI: 10.1093/comjnl/bxm052

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tree-width, path-width, and cutwidth

✍ Ephraim Korach; Nir Solel 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 387 KB

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

Laplacian pulse width, rms chirp, and th

Laplacian pulse width, rms chirp, and their applications

✍ Liang, A. H.; Tsang, H. K.; Chan, L. Y. 📂 Article 📅 1996 🏛 Optical Society of America 🌐 English ⚖ 185 KB

Tree-width, clique-minors, and eigenvalu

Tree-width, clique-minors, and eigenvalues

✍ Yuan Hong 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Let G be a simple graph with n vertices and tw(G) be the tree-width of G. Let (G) be the spectral radius of G and (G) be the smallest eigenvalue of G. The join G∇H of disjoint graphs of G and H is the graph obtained from G + H by joining each vertex of G to each vertex of H . In this paper, several

Tree-width and circumference of graphs

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

Tree-width of hypergraphs and surface du

Tree-width of hypergraphs and surface duality

✍ Frédéric Mazoit 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 332 KB