Pages that link to "Item:Q1091147"

The following pages link to Edge-connectivity augmentation problems (Q1091147):

Displaying 20 items.

• A New Approach to Splitting-Off (Q3503862) (← links)
• Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time (Q4238530) (← links)
• (Q4250196) (← links)
• Edge-Connectivity Augmentation with Partition Constraints (Q4255815) (← links)
• Extremal graphs in connectivity augmentation (Q4256090) (← links)
• (Q4537741) (← links)
• Structured Connectivity Augmentation (Q4555048) (← links)
• Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
• Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph (Q4916091) (← links)
• A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem (Q5101432) (← links)
• How to make a strongly connected digraph two-connected (Q5101433) (← links)
• Structured Connectivity Augmentation (Q5111243) (← links)
• Path-Contractions, Edge Deletions and Connectivity Preservation (Q5111736) (← links)
• Approximation algorithms for graph augmentation (Q5204328) (← links)
• Connectivity augmentation in plane straight line graphs (Q5300980) (← links)
• Posimodular function optimization (Q5918641) (← links)
• Augmenting trees so that every three vertices lie on a cycle (Q5957303) (← links)
• Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks (Q6139366) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• Network augmentation for disaster‐resilience against geographically correlated failure (Q6179691) (← links)