# An Optimal <i>O</i> ( <i>nm</i> ) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph

> Research article (ACM Transactions on Algorithms, 2019) · cited 11× · AI/ML

**Wikidata**: [openalex:W2965565043](https://www.wikidata.org/wiki/openalex:W2965565043)  
**Source**: https://4ort.xyz/entity/an-optimal-i-o-i-i-nm-i-algorithm-for-enumerating-all-walks-common-to-all-closed-edge-covering-walks-of-a-graph