CP(Graph): Introducing a Graph Computation Domain in Constraint Programming

DOI10.1007/11564751_18zbMath1153.68457OpenAlexW1652823179MaRDI 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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (18)

Combining SAT solvers with computer algebra systems to verify combinatorial conjectures ⋮ The salesman and the tree: the importance of search in CP ⋮ Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks ⋮ MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers ⋮ Combining Two Structured Domains for Modeling Various Graph Matching Problems ⋮ Global domain views for expressive and cross-domain constraint programming ⋮ Range-only SLAM with indistinguishable landmarks; a constraint programming approach ⋮ SAT Modulo Graphs: Acyclicity ⋮ Global constraint catalogue: past, present and future ⋮ Solving subgraph isomorphism problems with constraint programming ⋮ Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs ⋮ Filtering for Subgraph Isomorphism ⋮ Unnamed Item ⋮ Bounds of graph parameters for global constraints ⋮ Lazy Constraint Imposing for Improving the Path Constraint ⋮ Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms ⋮ Combining tree partitioning, precedence, and incomparability constraints ⋮ Path finding approaches and metabolic pathways

Uses Software

• CPGraph

This page was built for publication: CP(Graph): Introducing a Graph Computation Domain in Constraint Programming