On the complexity of the planar directed edge-disjoint paths problem (Q2583126): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-005-0653-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2055564944
@@ Property / OpenAlex ID: W2055564944 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+A fast algorithm for maximum integral two-commodity flow in planar graphs
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms
@@ Property / cites work: Combinatorial optimization. Theory and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the disjoint paths problem
@@ Property / cites work: On the complexity of the disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Disjoint Paths in a Directed Planar Graph
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Integer plane multiflows with a mixed number of demands
+Normal rank