Pages that link to "Item:Q4305357"
From MaRDI portal
The following pages link to Finding <i>k</i> Disjoint Paths in a Directed Planar Graph (Q4305357):
Displaying 40 items.
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
- On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- Network characterizations for excluding Braess's paradox (Q506543) (← links)
- Induced disjoint paths problem in a planar digraph (Q967379) (← links)
- The disjoint shortest paths problem (Q1392552) (← links)
- Finding multiple induced disjoint paths in general graphs (Q1944193) (← links)
- A trichotomy for regular simple path queries on graphs (Q2009646) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Polynomial time algorithms for tracking path problems (Q2144269) (← links)
- On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms (Q2232599) (← links)
- On the complexity of the planar directed edge-disjoint paths problem (Q2583126) (← links)
- A tight lower bound for edge-disjoint paths on planar DAGs (Q2692724) (← links)
- Complexity of a classical flow restoration problem (Q2811305) (← links)
- Theoretical and computational advances for network diversion (Q2811311) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Multiflow Feasibility: An Annotated Tableau (Q2971612) (← links)
- Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs (Q3004683) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- Planar Digraphs (Q3120437) (← links)
- Finding k Partially Disjoint Paths in a Directed Planar Graph (Q3295274) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs (Q3452786) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs (Q3508562) (← links)
- Improved Algorithms for the 2-Vertex Disjoint Paths Problem (Q3599102) (← links)
- A group-theoretical approach to disjoint paths in directed graphs (Q4280137) (← links)
- Paths in graphs and curves on surfaces (Q4324341) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241) (← links)
- (Q5090955) (← links)
- The Directed Disjoint Shortest Paths Problem (Q5111698) (← links)
- Half-integral linkages in highly connected directed graphs (Q5111723) (← links)
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) (← links)
- Walking through waypoints (Q5918830) (← links)
- Combinatorial acyclicity models for potential‐based flows (Q6065854) (← links)
- Detours in directed graphs (Q6113279) (← links)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)
