An optimal O(nm) algorithm for enumerating all walks common to all closed edge-covering walks of a graph. / Cairo, M.; Medvedev, P.; Acosta, N. O.; Rizzi, R.; Tomescu, A. I.In: ACM Transactions on Algorithms, Vol. 15, No. 4, 48, 07.2019.
Research output: Contribution to journal › Article › peer-review
TY - JOUR
T1 - An optimal O(nm) algorithm for enumerating all walks common to all closed edge-covering walks of a graph
AU - Cairo, M.
AU - Medvedev, P.
AU - Acosta, N. O.
AU - Rizzi, R.
AU - Tomescu, A. I.
N1 - Funding Information: A shorter version of this article appeared as the conference paper (Cairo et al. 2017). This journal version contains missing proofs, additional figures, implementation details, as well as other improvements as part of the review process. N.O.A. is partially supported by the Academy of Finland under the grant agreement number 314284. A.I.T. was partially supported by the Academy of Finland under the grant agreement number 274977. Authors’ addresses: M. Cairo, University of Trento, Department of Mathematics, Via Sommarive 14, 38123 Povo, Italy; email: firstname.lastname@example.org; P. Medvedev, Pennsylvania State University, Department of Computer Science and Engineering, W316 Westgate Building, University Park, PA 16802, USA; email: email@example.com; N. O. Acosta, Aalto University, Aalto SCI Computer Science, Konemiehentie 2, 02150 Espoo, Finland; email: firstname.lastname@example.org; R. Rizzi, University of Verona, Department of Computer Science, Ca’ Vignal 2, strada le Grazie 15, 37134 Verona, Italy; email: email@example.com; A. I. Tomescu, University of Helsinki, Department of Computer Science, P.O. Box 68, FI-00014 University of Helsinki, Finland; email: firstname.lastname@example.org. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s). © 2019 Copyright held by the owner/author(s). 1549-6325/2019/07-ART48 https://doi.org/10.1145/3341731
PY - 2019/7
Y1 - 2019/7
UR - http://www.scopus.com/inward/record.url?scp=85070062714&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85070062714&partnerID=8YFLogxK
U2 - 10.1145/3341731
DO - 10.1145/3341731
M3 - Article
AN - SCOPUS:85070062714
VL - 15
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
SN - 1549-6325
IS - 4
M1 - 48