Subgraph isomorphism on graph classes that exclude a substructure

DOI10.1007/s00453-020-00737-zzbMath1492.68102arXiv1905.10670MaRDI QIDQ5919029

Hans L. Bodlaender, Yusuke Kobayashi, Yasuaki Kobayashi, Yota Otachi, Yoshio Okamoto, Tesshu Hanaka, Tom C. van der Zanden

Publication date: 11 November 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.10670

zbMATH Keywords

subgraph isomorphism; parameterized complexity; minor-free graphs

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C83: Graph minors

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

68Q27: Parameterized complexity, tractability and kernelization