Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/8362
Title: | A unified theory of structural tractability for constraint satisfaction problems | Authors: | Cohen, David Jeavons, Peter GYSSENS, Marc |
Issue Date: | 2008 | Publisher: | ACADEMIC PRESS INC ELSEVIER SCIENCE | Source: | JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 74(5). p. 721-743 | Abstract: | In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decomposition methods can be characterised in terms of finding guarded decompositions satisfying certain specified additional conditions. Using the guarded decomposition framework we are also able to define a new form of decomposition, which we call a spread-cut. We show that the discovery of width-k spread-cut decompositions is tractable for each k, and that spread-cut decompositions strongly generalise many existing decomposition methods. Finally we exhibit a family of hypergraphs H-n, for n = 1, 2, 3..., where the minimum width of any hypertree decomposition of each H-n is 3n, but the width of the best spread-cut decomposition is only 2n+1. (c) 2007 Elsevier Inc. All rights reserved. | Notes: | Univ London, Dept Comp Sci, Egham, Surrey, England. Univ Oxford, Comp Lab, Oxford OX1 3QD, England. Hasselt Univ, Dept WNI, B-3590 Diepenbeek, Belgium. Transnatl Univ Limburg, B-3590 Diepenbeek, Belgium. | Keywords: | constraints; complexity; structural decomposition; hypertree | Document URI: | http://hdl.handle.net/1942/8362 | ISSN: | 0022-0000 | e-ISSN: | 1090-2724 | DOI: | 10.1016/j.jcss.2007.08.001 | ISI #: | 000256462000005 | Category: | A1 | Type: | Journal Contribution | Validations: | ecoom 2009 |
Appears in Collections: | Research publications |
Show full item record
SCOPUSTM
Citations
51
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
44
checked on Oct 13, 2024
Page view(s)
78
checked on Jun 14, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.