Pages that link to "Item:Q2367446"
From MaRDI portal
The following pages link to On the complexity of the disjoint paths problem (Q2367446):
Displaying 50 items.
- Edge routing with ordered bundles (Q283873) (← links)
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Criticality for multicommodity flows (Q473104) (← links)
- On the tractability of some natural packing, covering and partitioning problems (Q476298) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- The hardness of routing two pairs on one face (Q662307) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Multiflows in symmetric digraphs (Q713317) (← links)
- The indefinite period traveling salesman problem (Q724039) (← links)
- Packing paths in planar graphs (Q809091) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- Edge-disjoint paths in planar graphs (Q1069956) (← links)
- The complexity of planar graph choosability (Q1126188) (← links)
- Parallel complexity of computing a maximal set of disjoint paths (Q1186594) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- General vertex disjoint paths in series-parallel graphs (Q1208474) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- The disjoint shortest paths problem (Q1392552) (← links)
- Complexity of path discovery game problems (Q1566737) (← links)
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs (Q1739106) (← links)
- On the complexity of vertex-disjoint length-restricted path problems (Q1762664) (← links)
- Eulerian disjoint paths problem in grid graphs is NP-complete (Q1887070) (← links)
- NP-completeness of some edge-disjoint paths problems (Q1897369) (← links)
- A note on packing paths in planar graphs (Q1906072) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
- On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary (Q2149491) (← links)
- On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms (Q2232599) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- On the maximum degree of path-pairable planar graphs (Q2415080) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Complexity of the path avoiding forbidden pairs problem revisited (Q2446333) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- Precoloring extension on unit interval graphs (Q2492199) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs (Q2563924) (← links)
- On the complexity of the planar directed edge-disjoint paths problem (Q2583126) (← links)
- Multiflow Feasibility: An Annotated Tableau (Q2971612) (← links)
- BFS Solution for Disjoint Paths in P Systems (Q3007713) (← links)
- An Excluded Minor Characterization of Seymour Graphs (Q3009746) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- (Q3044357) (← links)
- (Q3341926) (← links)
- Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)
- Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs (Q3452786) (← links)
- Packing paths, circuits, and cuts --- a survey (Q3972951) (← links)
- Paths in graphs and curves on surfaces (Q4324341) (← links)
- (Q4940083) (← links)
