An optimal O(nm) algorithm for enumerating all walks common to all closed edge-covering walks of a graph

M. Cairo, P. Medvedev, N. O. Acosta, R. Rizzi, A. I. Tomescu

Research output: Contribution to journalArticlepeer-review

9 Citations (SciVal)
Original languageEnglish (US)
Article number48
JournalACM Transactions on Algorithms
Issue number4
StatePublished - Jul 2019

All Science Journal Classification (ASJC) codes

  • Mathematics (miscellaneous)

Cite this