Indexing with Well-Founded Total Order for Faster Subgraph Isomorphism Detection

DOI10.1007/978-3-642-20844-7_19zbMath1381.05076OpenAlexW1487058251MaRDI QIDQ3003464

Andreas Dengel, Marcus Liwicki, Markus Weber

Publication date: 27 May 2011

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-20844-7_19

zbMATH Keywords

decision treeindexingsubgraph isomorphismgraph isomorphismtree search

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)

This page was built for publication: Indexing with Well-Founded Total Order for Faster Subgraph Isomorphism Detection