Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs

Matsuo Konagaya, Yota Otachi, Ryuhei Uehara. Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs. In T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper, editors, Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings. Volume 8402 of Lecture Notes in Computer Science, pages 216-228, Springer, 2014. [doi]

@inproceedings{KonagayaOU14,
  title = {Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs},
  author = {Matsuo Konagaya and Yota Otachi and Ryuhei Uehara},
  year = {2014},
  doi = {10.1007/978-3-319-06089-7_15},
  url = {http://dx.doi.org/10.1007/978-3-319-06089-7_15},
  researchr = {https://researchr.org/publication/KonagayaOU14},
  cites = {0},
  citedby = {0},
  pages = {216-228},
  booktitle = {Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings},
  editor = {T. V. Gopal and Manindra Agrawal and Angsheng Li and S. Barry Cooper},
  volume = {8402},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-06088-0},
}