Subgraph Isomorphism on Graph Classes that Exclude a Substructure

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

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

Original languageEnglish
Number of pages22
JournalAlgorithmica
DOIs
Publication statusE-pub ahead of print - 2 Jul 2020

Keywords

  • Subgraph isomorphism
  • Minor-free graphs
  • Parameterized complexity
  • MODULAR DECOMPOSITION
  • COMPLEXITY

Cite this

Bodlaender, H. L., Hanaka, T., Kobayashi, Y., Kobayashi, Y., Okamoto, Y., Otachi, Y., & van der Zanden, T. C. (2020). Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica. https://doi.org/10.1007/s00453-020-00737-z