Pages that link to "Item:Q2948489"
From MaRDI portal
The following pages link to Parametrized Complexity of Length-Bounded Cuts and Multi-cuts (Q2948489):
Displaying 14 items.
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Length-bounded cuts and flows (Q3188986) (← links)
- Length-Bounded Cuts and Flows (Q3613800) (← links)
- Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts (Q4554936) (← 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)
- On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (Q5119381) (← links)
- Fixed-parameter tractability of multicut parameterized by the size of the cutset (Q5419117) (← links)
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset (Q5494921) (← links)
- (Q6084397) (← links)