Combining Two Structured Domains for Modeling Various Graph Matching Problems
From MaRDI portal
Publication:5302726
DOI10.1007/978-3-540-89812-2_6zbMath1162.68652OpenAlexW2178397985MaRDI QIDQ5302726
Grégoire Dooms, Yves Deville, Stéphane Zampelli
Publication date: 13 January 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89812-2_6
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Cardinal: a finite sets constraint solver
- A language and a program for stating and solving combinatorial problems
- Algorithms for approximate graph matching
- Symmetry breaking revisited
- Introducing global constraints in CHIP
- Solving a network design problem
- NP-SPEC: an executable specification language for solving all problems in NP
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- Filtering for Subgraph Isomorphism
- CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
- The Minimum Spanning Tree Constraint
- The “Not-Too-Heavy Spanning Tree” Constraint
- An Algorithm for Subgraph Isomorphism
- An algorithm using length-r paths to approximate subgraph isomorphism
- Constraint satisfaction algorithms for graph pattern matching
- The tree Constraint
- Filtering Algorithms for the NValue Constraint
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Combining Two Structured Domains for Modeling Various Graph Matching Problems