A unified framework for strengthening topological node features and its application to subgraph isomorphism detection

DOI10.1007/978-3-642-38221-5_2zbMATH Open1382.68165OpenAlexW138970988MaRDI QIDQ4922142FDOQ4922142

Authors: Nicholas Dahm, T. Caelli, Yongsheng Gao, Horst Bunke 

Publication date: 28 May 2013

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38221-5_2

Recommendations

• Efficient subgraph matching using topological node feature constraints
• scientific article; zbMATH DE number 1629832
• Method for subgraph matching with inclusion degree
• An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
• A new algorithm for induced subgraph isomorphism

zbMATH Keywords

graph matchingsubgraph isomorphismtopological node features

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (1)

• Efficient subgraph matching using topological node feature constraints

This page was built for publication: A unified framework for strengthening topological node features and its application to subgraph isomorphism detection

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