Planar Digraphs (Q3120437): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-71840-8_5
+Normal rank
@@ Property / OpenAlex ID @@
+W4231621931
@@ Property / OpenAlex ID: W4231621931 / rank @@
+Normal rank
@@ Property / cites work @@
+Irrelevant vertices for the planar disjoint paths problem
+Normal rank
@@ Property / cites work @@
+An             <i>O</i>             (             <i>n</i>             log             <i>n</i>             ) algorithm for maximum             <i>st</i>             -flow in a directed planar graph
+Normal rank
@@ Property / cites work @@
+The all-or-nothing flow problem in directed graphs with symmetric demand pairs
+Normal rank
@@ Property / cites work @@
+Q4598139
@@ Property / cites work: Q4598139 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity flow, well-linked terminals, and routing problems
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
+Normal rank
@@ Property / cites work @@
+On Independent Circuits Contained in a Graph
@@ Property / cites work: On Independent Circuits Contained in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417668
@@ Property / cites work: Q5417668 / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds on the planar branchwidth with respect to the largest grid minor size
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Directed tree-width
@@ Property / cites work: Directed tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+The Directed Grid Theorem
@@ Property / cites work: The Directed Grid Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph partitioning using single commodity flows
@@ Property / cites work: Graph partitioning using single commodity flows / rank @@
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing directed circuits
@@ Property / cites work: Packing directed circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Disjoint Paths in a Directed Planar Graph
+Normal rank
@@ Property / cites work @@
+Q4284627
@@ Property / cites work: Q4284627 / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank