Efficient subgraph matching using topological node feature constraints

DOI10.1016/j.patcog.2014.05.018zbMath1373.68348OpenAlexW2009810092MaRDI QIDQ1677053

Yongsheng Gao, Nicholas Dahm, Horst Bunke, T. M. Caelli

Publication date: 10 November 2017

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2014.05.018

zbMATH Keywords

graph matchingsubgraph isomorphismtopological node features

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Preface of special issue on ``Graph-based processing for pattern recognition ⋮ An approach for approximate subgraph matching in fuzzy RDF graph

Uses Software

• igraph
• gSpan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving subgraph isomorphism problems with constraint programming
• AllDifferent-based filtering for subgraph isomorphism
• A parametric filtering algorithm for the graph isomorphism problem
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• An Algorithm for Subgraph Isomorphism
• A large database of graphs and its use for benchmarking graph isomorphism algorithms
• Constraint satisfaction algorithms for graph pattern matching
• A Unified Framework for Strengthening Topological Node Features and Its Application to Subgraph Isomorphism Detection
• Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Network Science

This page was built for publication: Efficient subgraph matching using topological node feature constraints