A Heuristic Algorithm for Small Separators in Arbitrary Graphs (Q3474888): 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.1137/0219018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993946385 / rank | |||
Normal rank | |||
Latest revision as of 23:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Heuristic Algorithm for Small Separators in Arbitrary Graphs |
scientific article |
Statements
A Heuristic Algorithm for Small Separators in Arbitrary Graphs (English)
0 references
1990
0 references
random algorithms
0 references
separators in graphs
0 references
flows in networks
0 references
