Linear time algorithms for finding sparsest cuts in various graph classes (Q3439593): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 12:15, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear time algorithms for finding sparsest cuts in various graph classes |
scientific article |
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
