@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    = {Sun, 18 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/ConteGMV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"Cp4M7EtwXMttkE94A","bibbaseid":"conte-grossi-marino-versari-findingmaximalcommonsubgraphsviatimespaceefficientreversesearch-2018","downloads":0,"creationDate":"2018-07-23T16:14:34.522Z","title":"Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search","author_short":["Conte, A.","Grossi, R.","Marino, A.","Versari, L."],"year":2018,"bibtype":"inproceedings","biburl":"https://dblp.org/pid/57/7900.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Alessio"],"propositions":[],"lastnames":["Conte"],"suffixes":[]},{"firstnames":["Roberto"],"propositions":[],"lastnames":["Grossi"],"suffixes":[]},{"firstnames":["Andrea"],"propositions":[],"lastnames":["Marino"],"suffixes":[]},{"firstnames":["Luca"],"propositions":[],"lastnames":["Versari"],"suffixes":[]}],"editor":[{"firstnames":["Lusheng"],"propositions":[],"lastnames":["Wang"],"suffixes":[]},{"firstnames":["Daming"],"propositions":[],"lastnames":["Zhu"],"suffixes":[]}],"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":"Sun, 18 Jun 2023 01:00:00 +0200","biburl":"https://dblp.org/rec/conf/cocoon/ConteGMV18.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/cocoon/ConteGMV18,\n author = {Alessio Conte and\n Roberto Grossi and\n Andrea Marino and\n Luca Versari},\n editor = {Lusheng Wang and\n Daming Zhu},\n title = {Finding Maximal Common Subgraphs via Time-Space Efficient Reverse\n Search},\n booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON}\n 2018, Qing Dao, China, July 2-4, 2018, Proceedings},\n series = {Lecture Notes in Computer Science},\n volume = {10976},\n pages = {328--340},\n publisher = {Springer},\n year = {2018},\n url = {https://doi.org/10.1007/978-3-319-94776-1\\_28},\n doi = {10.1007/978-3-319-94776-1\\_28},\n timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/cocoon/ConteGMV18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Conte, A.","Grossi, R.","Marino, A.","Versari, L."],"editor_short":["Wang, L.","Zhu, D."],"key":"DBLP:conf/cocoon/ConteGMV18","id":"DBLP:conf/cocoon/ConteGMV18","bibbaseid":"conte-grossi-marino-versari-findingmaximalcommonsubgraphsviatimespaceefficientreversesearch-2018","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-319-94776-1\\_28"},"metadata":{"authorlinks":{"marino, a":"http://pages.di.unipi.it/marino/"}},"downloads":0},"search_terms":["finding","maximal","common","subgraphs","via","time","space","efficient","reverse","search","conte","grossi","marino","versari"],"keywords":[],"authorIDs":["ExwJcncJwbtdGPtir"],"dataSources":["kdGZkBFQjQnnvMnEr","PuBQPSuPv9o82kwx7"]}