Combining Two Structured Domains for Modeling Various Graph Matching Problems

DOI10.1007/978-3-540-89812-2_6MaRDI QIDQ5302726zbMATH OpenOpenAlexFDO

Authors Yves Deville, Grégoire Dooms, 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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Filtering for Subgraph Isomorphism
• Solving subgraph isomorphism problems with constraint programming
• CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
• Constraint satisfaction algorithms for graph pattern matching
• scientific article; zbMATH DE number 1629832

Cites work

• scientific article; zbMATH DE number 437527 (Why is no real title available?)
• scientific article; zbMATH DE number 2032420 (Why is no real title available?)
• scientific article; zbMATH DE number 2080298 (Why is no real title available?)
• A language and a program for stating and solving combinatorial problems
• Algorithms for approximate graph matching
• An Algorithm for Subgraph Isomorphism
• An algorithm using length-r paths to approximate subgraph isomorphism
• An exact constraint logic programming algorithm for the traveling salesman problem with time windows
• CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
• Cardinal: a finite sets constraint solver
• Constraint satisfaction algorithms for graph pattern matching
• Cost-based filtering for shorter path constraints
• Filtering Algorithms for the NValue Constraint
• Filtering for Subgraph Isomorphism
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Interval propagation to reason about sets: Definition and implementation of a practical language
• Introducing global constraints in CHIP
• NP-SPEC: An executable specification language for solving all problems in NP
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2004
• Solving a network design problem
• Symmetry breaking revisited
• The Minimum Spanning Tree Constraint
• The tree Constraint
• The “Not-Too-Heavy Spanning Tree” Constraint

Cited in

(3)

• CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
• Constraint satisfaction algorithms for graph pattern matching
• scientific article; zbMATH DE number 1629832 (Why is no real title available?)

Describes a project that uses

Uses Software

• GraphGrep
• CPGraph
• Cardinal
• NP-SPEC
• GraphBase

This page was built for publication: Combining Two Structured Domains for Modeling Various Graph Matching Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302726)