✦ LIBER ✦

Constraint satisfaction with bounded treewidth revisited

✍ Scribed by Marko Samer; Stefan Szeider

Book ID: 108166571
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 316 KB
Volume: 76
Category: Article
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2009.04.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of constraint satisfactio

The complexity of constraint satisfaction revisited

✍ Alan K. Mackworth; Eugene C. Freuder 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 327 KB

Mackworth, A.K. and E.C. Freuder, The complexity of constraint satisfaction revisited, Artificial Intelligence 59 (1993) 57-62. This paper is a retrospective account of some of the developments leading up to, and ensuing from, the analysis of the complexity of some polynomial network consistency alg

Treewidth Lower Bounds with Brambles

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

Parallel Algorithms with Optimal Speedup

Parallel Algorithms with Optimal Speedup for Bounded Treewidth

✍ Bodlaender, Hans L.; Hagerup, Torben 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 371 KB

Embedding Graphs with Bounded Treewidth

Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes

✍ Volker Heun; Ernst W. Mayr 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 336 KB

Surviving Rates of Graphs with Bounded T

Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem

✍ Cai, Leizhen; Cheng, Yongxi; Verbin, Elad; Zhou, Yuan 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 463 KB

Tractable Structures for Constraint Sati

Tractable Structures for Constraint Satisfaction with

✍ Dániel Marx 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 497 KB