Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. Conte, A., Grossi, R., Marino, A., & Versari, L. In Wang, L. & Zhu, D., editors, Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings, volume 10976, of Lecture Notes in Computer Science, pages 328–340, 2018. Springer.
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/cocoon/ConteGMV18,
  author    = {Alessio Conte and
               Roberto Grossi and
               Andrea Marino and
               Luca Versari},
  editor    = {Lusheng Wang and
               Daming Zhu},
  title     = {Finding Maximal Common Subgraphs via Time-Space Efficient Reverse
               Search},
  booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON}
               2018, Qing Dao, China, July 2-4, 2018, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10976},
  pages     = {328--340},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-319-94776-1\_28},
  doi       = {10.1007/978-3-319-94776-1\_28},
  timestamp = {Thu, 20 Aug 2020 16:02:36 +0200},
  biburl    = {https://dblp.org/rec/conf/cocoon/ConteGMV18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0