Pages that link to "Item:Q1208926"

The following pages link to A minimum 3-connectivity augmentation of a graph (Q1208926):

Displaying 12 items.

• An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
• Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
• Smallest bipartite bridge-connectivity augmentation (Q834588) (← links)
• The bridge-connectivity augmentation problem with a partition constraint (Q982661) (← links)
• Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
• Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
• A smallest augmentation to 3-connect a graph (Q1813979) (← links)
• Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
• Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846) (← links)
• How to make a strongly connected digraph two-connected (Q5101433) (← links)
• Optimal augmentation for bipartite componentwise biconnectivity in linear time (Q6487441) (← links)
• Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract) (Q6487973) (← links)