Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?

DOI10.1007/978-3-642-32241-9_4zbMath1364.68228OpenAlexW1960457407MaRDI QIDQ2914309

Mirosław Kowaluk, Eva-Marta Lundell, Peter Floderus, Andrzej Lingas

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Induced subgraph isomorphism: are some patterns substantially easier than others? ⋮ Detecting and Counting Small Pattern Graphs

This page was built for publication: Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?