Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 120-133
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Efficiently enumerating results of keyword search over data graphsInformation Systems, 2008
- On the Hardness of Losing Weight2008
- On Acyclic Conjunctive Queries and Constant Delay Enumeration2007
- Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries2006
- Parameterized complexity of constraint satisfaction problemscomputational complexity, 2005
- Tractable Decision for a Constraint Language Implies Tractable SearchConstraints, 2004
- New Algorithms for Enumerating All Maximal Cliques2004
- On the algebraic structure of combinatorial problemsTheoretical Computer Science, 1998
- Planar graph coloring is not self-reducible, assuming P ≠ NPTheoretical Computer Science, 1991
- On generating all maximal independent setsInformation Processing Letters, 1988