Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph (Q2062131)
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: Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph |
scientific article; zbMATH DE number 7450580
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph |
scientific article; zbMATH DE number 7450580 |
Statements
Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph (English)
0 references
22 December 2021
0 references
divide-and-conquer
0 references
graph theory
0 references
spanning tree
0 references
0 references
0 references
