Pages that link to "Item:Q4741713"
From MaRDI portal
The following pages link to The complexity of finding maximum disjoint paths with length constraints (Q4741713):
Displayed 20 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks (Q877588) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Lower bounds on two-terminal network reliability (Q1116878) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- The disjoint shortest paths problem (Q1392552) (← links)
- Length-bounded disjoint paths in planar graphs (Q1613380) (← links)
- Finding the most vital arcs in a network (Q1823164) (← links)
- Counterexamples to theorems of Menger type for the diameter (Q1838498) (← links)
- Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph (Q1959418) (← links)
- Self-spanner graphs (Q2565853) (← links)
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
- Length-constrained path-matchings in graphs (Q3150130) (← links)
- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms (Q3656863) (← links)
- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
- Balanced paths in acyclic networks: Tractable cases and related approaches (Q4667719) (← links)
- Searching for a Visible, Lazy Fugitive (Q5302068) (← links)