Linear time algorithms for finding sparsest cuts in various graph classes (Q3439593): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2007.01.039
+Normal rank
@@ Property / OpenAlex ID @@
+W2139531571
@@ Property / OpenAlex ID: W2139531571 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsest cuts and concurrent flows in product graphs.
+Normal rank
@@ Property / cites work @@
+A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
+Normal rank
@@ Property / cites work @@
+Q4342632
@@ Property / cites work: Q4342632 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Sparsest cuts and bottlenecks in graphs
@@ Property / cites work: Sparsest cuts and bottlenecks in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank