Linear time algorithms for finding sparsest cuts in various graph classes (Q3439593): 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.1016/j.endm.2007.01.039 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2139531571 / rank | |||
Normal rank | |||
Revision as of 20:53, 19 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
