CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
From MaRDI portal
Publication:3524175
DOI10.1007/11564751_18zbMath1153.68457MaRDI QIDQ3524175
No author found.
Publication date: 9 September 2008
Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11564751_18
90C35: Programming involving graphs or networks
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Lazy Constraint Imposing for Improving the Path Constraint, Combining Two Structured Domains for Modeling Various Graph Matching Problems, The salesman and the tree: the importance of search in CP, Solving subgraph isomorphism problems with constraint programming, Global constraint catalogue: past, present and future, Combining tree partitioning, precedence, and incomparability constraints, Path finding approaches and metabolic pathways, SAT Modulo Graphs: Acyclicity, MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers, Filtering for Subgraph Isomorphism, Bounds of graph parameters for global constraints, Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
Uses Software