✦ LIBER ✦

Treewidth computations II. Lower bounds

✍ Scribed by Hans L. Bodlaender; Arie M.C.A. Koster

Book ID: 113641990
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 335 KB
Volume: 209
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2011.04.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Treewidth computations I. Upper bounds

✍ Hans L. Bodlaender; Arie M.C.A. Koster 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 427 KB

Treewidth Lower Bounds with Brambles

✍ Hans L. Bodlaender; Alexander Grigoriev; Arie M. C. A. Koster 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 426 KB

Computational lower bounds using diagona

Computational lower bounds using diagonalization — II

✍ M. V. Panduranga Rao 📂 Article 📅 2010 🏛 Indian Academy of Sciences 🌐 English ⚖ 192 KB

Two nonlinear lower bounds for on-line c

Two nonlinear lower bounds for on-line computations

✍ Pavol Dūrī; Zvi Galil; Wolfgang Paul; Ruediger Reischuk 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 495 KB

Lower Bounds on the Depth of Monotone Ar

Lower Bounds on the Depth of Monotone Arithmetic Computations

✍ Don Coppersmith; Baruch Schieber 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 128 KB

dedicated to zvi galil's 50th birthday Consider an arithmetic expression of length n involving only the operations [+, \_] and non-negative constants. We prove lower bounds on the depth of any binary computation tree over the same sets of operations and constants that computes such an expression. We

A spectral lower bound for the treewidth

A spectral lower bound for the treewidth of a graph and its consequences

✍ L.Sunil Chandran; C.R. Subramanian 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 95 KB

We give a lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. We use this lower bound to show that the treewidth of a d-dimensional hypercube is at least 3 We generalize this result to Hamming graphs. We also observe that every graph G on n v