The following pages link to Length-bounded cuts and flows (Q3188986):
Displaying 30 items.
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q372974) (← 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)
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- The complexity of finding small separators in temporal graphs (Q2009634) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
- New Complexity Results and Algorithms for the Minimum Tollbooth Problem (Q3460779) (← links)
- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms (Q3656863) (← 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)
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
- The Complexity of Finding Small Separators in Temporal Graphs (Q5005147) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Solving the Distance-Based Critical Node Problem (Q5087707) (← 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)
- The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
- The Maximum Flow Problem for Oriented Flows (Q5240225) (← links)
- (Q6084397) (← links)
- (Q6087208) (← links)
- Assistance and interdiction problems on interval graphs (Q6094722) (← links)
- Snapshot disjointness in temporal graphs (Q6589845) (← links)
- Finding conserved low-diameter subgraphs in social and biological networks (Q6659091) (← links)
- Fitting metrics and ultrametrics with minimum disagreements (Q6670352) (← links)
