Constraint satisfaction algorithms for graph pattern matching
From MaRDI portal
Publication:4792942
DOI10.1017/S0960129501003577zbMath1009.68103OpenAlexW2167058518MaRDI QIDQ4792942
Gabriel Valiente, Javier Larrosa
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)
Related Items (16)
Combining Two Structured Domains for Modeling Various Graph Matching Problems ⋮ Multi-objective optimization model and evolutional solution of network node matching problem ⋮ Matching graphs with unique node labels ⋮ A dynamic generating graphical model for point-sets matching ⋮ Solving subgraph isomorphism problems with constraint programming ⋮ 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 ⋮ Filtering for Subgraph Isomorphism ⋮ GETGRATS ⋮ AllDifferent-based filtering for subgraph isomorphism ⋮ On the Complexity of Concurrent Multiset Rewriting ⋮ On the subgraph epimorphism problem ⋮ Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms ⋮ Efficient Suboptimal Graph Isomorphism ⋮ Matching of Bigraphs
Uses Software
This page was built for publication: Constraint satisfaction algorithms for graph pattern matching
