The complexity of finding maximum disjoint paths with length constraints

Cited in

(51)

Combinatorial analysis (nonnegative matrices, algorithmic problems)
Lower bounds on two-terminal network reliability
Large fault-tolerant interconnection networks
The disjoint shortest paths problem
Length-bounded disjoint paths in planar graphs
Parameterized complexity of length-bounded cuts and multicuts
Finding the most vital arcs in a network
Counterexamples to theorems of Menger type for the diameter
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
Edge degeneracy: algorithmic and structural results
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
An efficient algorithm for testing goal-minimality of graphs
Self-spanner graphs
Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
On b-acyclic chromatic number of a graph
OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
On \(s\)--\(t\) paths and trails in edge-colored graphs
Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
Length-constrained path-matchings in graphs
On the hop-constrained survivable network design problem with reliable edges
New algorithms for pattern matching with wildcards and length constraints
Paths of bounded length and their cuts: parameterized complexity and algorithms
Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor
Finding paths with minimum shared edges
On shortest disjoint paths in planar graphs
On the maximum disjoint paths problem on edge-colored graphs
Paths of bounded length and their cuts: parameterized complexity and algorithms
Fractals for kernelization lower bounds
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
Balanced paths in acyclic networks: Tractable cases and related approaches
On Fault-Tolerant Low-Diameter Clusters in Graphs
On 2-clubs in graph-based data clustering: theory and algorithm engineering
On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow
Minimum violation vertex maps and their applications to cut problems
Searching for a Visible, Lazy Fugitive
Hop-level flow formulation for the survivable network design with hop constraints problem
Graph theory (algorithmic, algebraic, and metric problems)
The complexity of finding two disjoint paths with min-max objective function
Walking through waypoints
Complexity of the traveling tournament problem
The Menger number of the Cartesian product of graphs
Designing distrance-preserving fault-tolerant topologies
Computing disjoint paths with length constraints
Snapshot disjointness in temporal graphs
Hardness of the generalized coloring numbers
Filming runners with drones is hard
Finding disjoint paths with related path costs
Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
Pattern matching with wildcards and length constraints using maximum network flow

This page was built for publication: The complexity of finding maximum disjoint paths with length constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4741713)