Q5075827 (Q5075827): Difference between revisions

@@ Property / cites work @@
+Straight line triangle representations
@@ Property / cites work: Straight line triangle representations / rank @@
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
+Normal rank
@@ Property / cites work @@
+Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
+Normal rank
@@ Property / cites work @@
+Straightening polygonal arcs and convexifying polygonal cycles
+Normal rank
@@ Property / cites work @@
+Towards an optimal algorithm for recognizing Laman graphs
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+A matroid approach to finding edge connectivity and packing arborescences
+Normal rank
@@ Property / cites work @@
+Using expander graphs to find vertex connectivity
@@ Property / cites work: Using expander graphs to find vertex connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Forests, frames, and games: Algorithms for matroid sums and applications
+Normal rank
@@ Property / cites work @@
+Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
+Normal rank
@@ Property / cites work @@
+All-Pairs 2-Reachability in O(n^w log n) Time
@@ Property / cites work: All-Pairs 2-Reachability in O(n^w log n) Time / rank @@
+Normal rank
@@ Property / cites work @@
+Planar minimally rigid graphs and pseudo-triangulations
+Normal rank
@@ Property / cites work @@
+Finding strong bridges and strong articulation points in linear time
+Normal rank
@@ Property / cites work @@
+An algorithm for two-dimensional rigidity percolation: The pebble game
+Normal rank
@@ Property / cites work @@
+Q2990097
@@ Property / cites work: Q2990097 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum flow in directed planar graphs with vertex capacities
+Normal rank
@@ Property / cites work @@
+Combinatorial and Geometric Properties of Planar Laman Graphs
+Normal rank
@@ Property / cites work @@
+On graphs and rigidity of plane skeletal structures
+Normal rank
@@ Property / cites work @@
+Pebble game algorithms and sparse graphs
@@ Property / cites work: Pebble game algorithms and sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607913
@@ Property / cites work: Q4607913 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial pseudo-triangulations
@@ Property / cites work: Combinatorial pseudo-triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Max flows in O(nm) time, or better
@@ Property / cites work: Max flows in O(nm) time, or better / rank @@
+Normal rank
@@ Property / cites work @@
+Q3514529
@@ Property / cites work: Q3514529 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple test on 2-vertex- and 2-edge-connectivity
+Normal rank
@@ Property / cites work @@
+Acute triangulations of polygons
@@ Property / cites work: Acute triangulations of polygons / rank @@
+Normal rank