A Bound for Non-subgraph Isomorphism

DOI10.1007/978-3-540-72903-7_7zbMath1182.68154OpenAlexW2128390795MaRDI QIDQ5325719

Christian Schellewald

Publication date: 24 July 2009

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-540-72903-7_7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: A Bound for Non-subgraph Isomorphism