An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset (Q3902508): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/322217.322220 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2167046094 / rank | |||
Normal rank | |||
Latest revision as of 22:52, 19 March 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
