An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset (Q3902508): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 447 / rank | |||
Normal rank | |||
Revision as of 21:44, 29 February 2024
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
