Listing Subgraphs by Cartesian Decomposition. Conte, A., Grossi, R., Marino, A., Rizzi, R., & Versari, L. In Potapov, I., Spirakis, P. G., & Worrell, J., editors, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, volume 117, of LIPIcs, pages 84:1–84:16, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Listing Subgraphs by Cartesian Decomposition [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/mfcs/ConteGMRV18,
  author    = {Alessio Conte and
               Roberto Grossi and
               Andrea Marino and
               Romeo Rizzi and
               Luca Versari},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Listing Subgraphs by Cartesian Decomposition},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {84:1--84:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.84},
  doi       = {10.4230/LIPIcs.MFCS.2018.84},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/ConteGMRV18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0