Sparsest cuts and bottlenecks in graphs (Q810053): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5514188 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3856819 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3691767 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The maximum concurrent flow problem / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(90)90133-w / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1989720410 / rank | |||
Normal rank |
Latest revision as of 10:55, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sparsest cuts and bottlenecks in graphs |
scientific article |
Statements
Sparsest cuts and bottlenecks in graphs (English)
0 references
1990
0 references
It is shown that the problem of finding a sparsest cut of a graph is NP- hard in general. However, certain classes of graphs on n vertices are shown to admit solutions in O(n), \(O(n^ 2)\) and \(O(n^ 2\sqrt{\log n})\) times respectively. The paper goes on to consider the maximum concurrent flow problem. In this problem, cuts with maximum density are termed ``bottle necks''. The near dual relationship between this problem and the sparsest cut problem is exploited to determine a broad class of graphs for which the sparsest cut problem is efficiently solvable.
0 references
bottlenecks
0 references
network
0 references
sparsest cut
0 references
NP-hard
0 references