An Optimal <i>O</i> ( <i>nm</i> ) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph (Q4973044)
From MaRDI portal
scientific article; zbMATH DE number 7138978
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal <i>O</i> ( <i>nm</i> ) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph |
scientific article; zbMATH DE number 7138978 |
Statements
An Optimal <i>O</i> ( <i>nm</i> ) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph (English)
0 references
2 December 2019
0 references
genome assembly
0 references
edge-covering walk
0 references
graph algorithm
0 references
safe and complete algorithm
0 references
strong bridge
0 references
