An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset (Q3902508)
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 Enumerate All Cutsets of a Graph in Linear Time per Cutset |
scientific article; zbMATH DE number 3711403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset |
scientific article; zbMATH DE number 3711403 |
Statements
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset (English)
0 references
1980
0 references
graph algorithms
0 references
backtracking
0 references
