@inproceedings{conte:hal-01964703, TITLE = {{Listing Subgraphs by Cartesian Decomposition}}, AUTHOR = {Conte, Alessio and Grossi, Roberto P and Marino, Andrea and Rizzi, Romeo and Versari, Luca P}, URL = {https://inria.hal.science/hal-01964703}, BOOKTITLE = {{MFCS 2018 - International Symposium on Mathematical Foundations of Computer Science}}, ADDRESS = {Liverpool, United Kingdom}, SERIES = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, VOLUME = {117}, PAGES = {1868-8969}, YEAR = {2018}, MONTH = Aug, DOI = {10.4230/LIPIcs.MFCS.2018.84}, KEYWORDS = {Graph algorithms ; listing ; minimum spanning trees ; constant delay}, PDF = {https://inria.hal.science/hal-01964703/file/LIPIcs-MFCS-2018-84.pdf}, HAL_ID = {hal-01964703}, HAL_VERSION = {v1}, }