Recent Advances in Constraints

DOI10.1007/11754602zbMath1180.68242OpenAlexW4299689167MaRDI QIDQ5899108

Johan Thapper, Ola Angelsmark

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11754602

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Exact algorithms for exact satisfiability and number of perfect matchings ⋮ Computing lower bounds for minimum sum coloring and optimum cost chromatic partition ⋮ A comparison of problem decomposition techniques for the FAP ⋮ Faster graph coloring in polynomial space

This page was built for publication: Recent Advances in Constraints