Cited in
(27)- Combining tree partitioning, precedence, and incomparability constraints
- Range-only SLAM with indistinguishable landmarks; a constraint programming approach
- Lazy constraint imposing for improving the path constraint
- Bounds of graph parameters for global constraints
- Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs
- Global constraint catalogue: past, present and future
- MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers
- Global domain views for expressive and cross-domain constraint programming
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- NP-SPEC
- TSPTW
- Cardinal
- Solving subgraph isomorphism problems with constraint programming
- CaSPER
- GRASPER
- Lynx
- MathCheck
- GraphGrep
- SageSAT
- MSLAM
- OMG
- Solving quantifier-free first-order constraints over finite sets and binary relations
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
- CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
- scientific article; zbMATH DE number 7455732 (Why is no real title available?)
- Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks
This page was built for software: CPGraph
