Constraint satisfaction algorithms for graph pattern matching

DOI10.1017/S0960129501003577MaRDI QIDQ4792942zbMATH OpenOpenAlexFDO

Authors Javier Larrosa, Gabriel Valiente

Publication date 17 February 2003

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129501003577

zbMATH Keywords

graph pattern matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Recommendations

• Combining Two Structured Domains for Modeling Various Graph Matching Problems
• scientific article; zbMATH DE number 1629832
• Solving subgraph isomorphism problems with constraint programming
• Filtering for Subgraph Isomorphism
• Constraint programming and graph algorithms.

Cited in

(21)

• A long trip in the charming world of graphs for pattern recognition
• Efficient subgraph matching using topological node feature constraints
• An inductive characterization of matching in binding bigraphs
• Multi-objective optimization model and evolutional solution of network node matching problem
• scientific article; zbMATH DE number 1629832 (Why is no real title available?)
• On the complexity of concurrent multiset rewriting
• Matching of bigraphs
• Incremental graph pattern matching
• Filtering for Subgraph Isomorphism
• Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
• Efficient Suboptimal Graph Isomorphism
• Simulation relations for pattern matching in directed graphs
• scientific article; zbMATH DE number 1964826 (Why is no real title available?)
• scientific article; zbMATH DE number 1523001 (Why is no real title available?)
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Combining Two Structured Domains for Modeling Various Graph Matching Problems
• Solving subgraph isomorphism problems with constraint programming
• On the subgraph epimorphism problem
• Matching graphs with unique node labels
• A dynamic generating graphical model for point-sets matching
• AllDifferent-based filtering for subgraph isomorphism

Describes a project that uses

Uses Software

• GraphBase
• LEDA

This page was built for publication: Constraint satisfaction algorithms for graph pattern matching

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