Linear time algorithms for finding sparsest cuts in various graph classes (Q3439593): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Sparsest cuts and concurrent flows in product graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4342632 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparsest cuts and bottlenecks in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank |
Latest revision as of 20:12, 25 June 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
0 references