Subgraph Isomorphism on Graph Classes that Exclude a Substructure

H.L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom van der Zanden

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Original languageEnglish
Title of host publicationAlgorithms and Complexity
Subtitle of host publication11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings
EditorsPinar Heggernes
PublisherSpringer, Cham
Pages87-98
ISBN (Electronic)978-3-030-17402-6
ISBN (Print)978-3-030-17401-9
DOIs
Publication statusPublished - 2019

Publication series

SeriesLecture Notes in Computer Science
Volume11485
ISSN0302-9743
SeriesTheoretcial Computer Science and General Issues (LNTCS)
Volume11485

Keywords

  • Subgraph isomorphism
  • minor free graphs
  • parameterized complexity

Cite this

Bodlaender, H. L., Hanaka, T., Okamoto, Y., Otachi, Y., & van der Zanden, T. (2019). Subgraph Isomorphism on Graph Classes that Exclude a Substructure. In P. Heggernes (Ed.), Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings (pp. 87-98). Springer, Cham. Lecture Notes in Computer Science, Vol.. 11485, Theoretcial Computer Science and General Issues (LNTCS), Vol.. 11485 https://doi.org//10.1007/978-3-030-17402-6_8