BibTeX record conf/fct/AkutsuTMT13

• > Home > conf/fct/AkutsuTMT13

@inproceedings{DBLP:conf/fct/AkutsuTMT13,
  author       = {Tatsuya Akutsu and
                  Takeyuki Tamura and
                  Avraham A. Melkman and
                  Atsuhiro Takasu},
  editor       = {Leszek Gasieniec and
                  Frank Wolter},
  title        = {On the Complexity of Finding a Largest Common Subtree of Bounded Degree},
  booktitle    = {Fundamentals of Computation Theory - 19th International Symposium,
                  {FCT} 2013, Liverpool, UK, August 19-21, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8070},
  pages        = {4--15},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40164-0\_4},
  doi          = {10.1007/978-3-642-40164-0\_4},
  timestamp    = {Fri, 09 Apr 2021 18:52:18 +0200},
  biburl       = {https://dblp.org/rec/conf/fct/AkutsuTMT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}