Linear time algorithms for finding sparsest cuts in various graph classes (Q3439593)
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 5158413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear time algorithms for finding sparsest cuts in various graph classes |
scientific article; zbMATH DE number 5158413 |
Statements
Linear time algorithms for finding sparsest cuts in various graph classes (English)
0 references
29 May 2007
0 references
sparsest cut
0 references
minimum ratio cut
0 references
linear time
0 references
graph class
0 references
0 references
0.8549574613571167
0 references
0.8164015412330627
0 references
0.7505143880844116
0 references
0.7491786479949951
0 references
