Pages that link to "Item:Q2638376"

The following pages link to Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376):

Displaying 11 items.

• An extended network interdiction problem for optimal toll control (Q325471) (← 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)
• Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
• On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← 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)
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
• (Q6084397) (← links)
• (Q6087208) (← links)