A Unified Framework for Strengthening Topological Node Features and Its Application to Subgraph Isomorphism Detection

DOI10.1007/978-3-642-38221-5_2zbMath1382.68165OpenAlexW138970988MaRDI QIDQ4922142

Yongsheng Gao, Nicholas Dahm, T. M. Caelli, 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

zbMATH Keywords

graph matchingsubgraph isomorphismtopological node features

Mathematics Subject Classification ID

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

Related Items (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