An algorithm for finding a short closed spanning walk in a graph (Q3885792)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for finding a short closed spanning walk in a graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a short closed spanning walk in a graph |
scientific article |
Statements
An algorithm for finding a short closed spanning walk in a graph (English)
0 references
1980
0 references
closed spanning walk
0 references
polynomially bounded algorithm
0 references
