Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)
Guido Sciavicco, Matteo Zavatteri, and Tiziano Villa. Mining Significant Temporal Networks Is Polynomial. In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 11:1-11:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{sciavicco_et_al:LIPIcs.TIME.2020.11, author = {Sciavicco, Guido and Zavatteri, Matteo and Villa, Tiziano}, title = {{Mining Significant Temporal Networks Is Polynomial}}, booktitle = {27th International Symposium on Temporal Representation and Reasoning (TIME 2020)}, pages = {11:1--11:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-167-2}, ISSN = {1868-8969}, year = {2020}, volume = {178}, editor = {Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.11}, URN = {urn:nbn:de:0030-drops-129792}, doi = {10.4230/LIPIcs.TIME.2020.11}, annote = {Keywords: Mining temporal constraints, cstnud, uncertainty, significant temporal network} }
Feedback for Dagstuhl Publishing