An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset (Q3902508)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset |
scientific article |
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
