An algorithm to generate all spanning trees with flow (Q1410995)
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 to generate all spanning trees with flow |
scientific article; zbMATH DE number 1993308
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to generate all spanning trees with flow |
scientific article; zbMATH DE number 1993308 |
Statements
An algorithm to generate all spanning trees with flow (English)
0 references
15 October 2003
0 references
spanning tree
0 references
flow
0 references
minimal path
0 references
undirected network
0 references
0 references
