Principles and Practice of Constraint Programming – CP 2003
From MaRDI portal
Publication:5897192
DOI10.1007/b13743zbMath1273.68330OpenAlexW2497660909MaRDI QIDQ5897192
Publication date: 2 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13743
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
An enumerative algorithm for \#2SAT ⋮ A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems ⋮ Counting models for 2SAT and 3SAT formulae ⋮ On two techniques of combining branching and treewidth ⋮ Exact algorithms for counting 3-colorings of graphs