A Heuristic Algorithm for Small Separators in Arbitrary Graphs (Q3474888)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4143441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Heuristic Algorithm for Small Separators in Arbitrary Graphs |
scientific article; zbMATH DE number 4143441 |
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
0.8217518925666809
0 references
0.8211684226989746
0 references
0.8146159648895264
0 references
0.8070792555809021
0 references
