Pages that link to "Item:Q1762664"
From MaRDI portal
The following pages link to On the complexity of vertex-disjoint length-restricted path problems (Q1762664):
Displaying 20 items.
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks (Q281809) (← links)
- On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
- Length 3 edge-disjoint paths is NP-hard (Q445249) (← links)
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- Maximum \(k\)-splittable \(s, t\)-flows (Q927403) (← links)
- On vertex-degree restricted paths in polyhedral graphs (Q1970577) (← links)
- On the computational complexity of length- and neighborhood-constrained path problems (Q2294439) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- On the complexity of the disjoint paths problem (Q2367446) (← links)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- The Complexity of Restricted Variants of the Stable Paths Problem (Q3000275) (← links)
- Length-constrained path-matchings in graphs (Q3150130) (← links)
- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms (Q3656863) (← links)
- Heuristics for finding a maximum number of disjoint bounded paths (Q3695028) (← links)
- On the length of simplex paths: The assignment case (Q3698637) (← links)
- Simple paths with exact and forbidden lengths (Q4562938) (← links)
- On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (Q5119381) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← links)
