@inproceedings{conte:hal-01964709, TITLE = {{Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search}}, AUTHOR = {Conte, Alessio and Grossi, Roberto P and Marino, Andrea and Versari, Luca P}, URL = {https://inria.hal.science/hal-01964709}, BOOKTITLE = {{COCOON 2018 - International Computing and Combinatorics Conference}}, ADDRESS = {Qing Dao, China}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10976}, PAGES = {328-340}, YEAR = {2018}, MONTH = Jul, DOI = {10.1007/978-3-319-94776-1\_28}, PDF = {https://inria.hal.science/hal-01964709/file/main%202.pdf}, HAL_ID = {hal-01964709}, HAL_VERSION = {v1}, }