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):
Displaying 50 items.
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks (Q281809) (← links)
- On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
- Finding paths with minimum shared edges (Q386426) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- Complexity of the traveling tournament problem (Q620946) (← links)
- The Menger number of the Cartesian product of graphs (Q628251) (← 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)
- Pattern matching with wildcards and length constraints using maximum network flow (Q891817) (← 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)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← 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)
- Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks (Q2402675) (← links)
- An efficient algorithm for testing goal-minimality of graphs (Q2446346) (← 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)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- On \(s\)--\(t\) paths and trails in edge-colored graphs (Q2840541) (← links)
- Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models (Q3087850) (← links)
- Length-constrained path-matchings in graphs (Q3150130) (← links)
- New algorithms for pattern matching with wildcards and length constraints (Q3451071) (← 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)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- Balanced paths in acyclic networks: Tractable cases and related approaches (Q4667719) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
- On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (Q5119381) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- Searching for a Visible, Lazy Fugitive (Q5302068) (← links)
- Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
- Walking through waypoints (Q5918830) (← links)
- Designing distrance-preserving fault-tolerant topologies (Q6550558) (← links)
- Computing disjoint paths with length constraints (Q6550560) (← links)
- Snapshot disjointness in temporal graphs (Q6589845) (← links)
