On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.12.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2049003114
@@ Property / OpenAlex ID: W2049003114 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding disjoint paths with different path-costs: Complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Finding disjoint paths with related path costs
@@ Property / cites work: Finding disjoint paths with related path costs / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint paths in a network
@@ Property / cites work: Disjoint paths in a network / rank @@
+Normal rank
@@ Property / cites work @@
+A quick method for finding shortest pairs of disjoint paths
+Normal rank
@@ Property / cites work @@
+The complexity of finding two disjoint paths with min-max objective function
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs. (Reprint)
@@ Property / cites work: Disjoint paths in graphs. (Reprint) / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Solution to the Undirected Two Paths Problem
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Length-bounded disjoint paths in planar graphs
@@ Property / cites work: Length-bounded disjoint paths in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Disjoint Paths in a Directed Planar Graph
+Normal rank
@@ Property / cites work @@
+On finding Min-Min disjoint paths
@@ Property / cites work: On finding Min-Min disjoint paths / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank