"An Optimal O(nm) Algorithm for Enumerating All Walks Common ..."

Massimo Cairo et al. (2019)

> Home

Details and statistics

DOI: 10.1145/3341731

access: closed

type: Journal Article

metadata version: 2022-01-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/CairoMART19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/CairoMART19
Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. ACM Trans. Algorithms 15(4): 48:1-48:17 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.