Pages that link to "Item:Q1091147"

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

Displaying 50 items.

• Augmenting edge-connectivity between vertex subsets (Q472470) (← links)
• Covering symmetric supermodular functions by uniform hypergraphs (Q598465) (← links)
• Augmenting the rigidity of a graph in \(\mathbb R^{2}\) (Q627536) (← links)
• Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
• Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
• Connectivity augmentation in planar straight line graphs (Q661949) (← links)
• Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
• Regular augmentation of planar graphs (Q747622) (← links)
• On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
• Minimum cost subpartitions in graphs (Q845968) (← links)
• Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (Q848841) (← links)
• Minimum degree orderings (Q848936) (← links)
• Augmenting the connectivity of outerplanar graphs (Q848960) (← links)
• Augmenting the connectivity of geometric graphs (Q929747) (← links)
• Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
• Minimizing a monotone concave function with laminar covering constraints (Q943837) (← links)
• Local edge-connectivity augmentation in hypergraphs is NP-complete (Q968204) (← links)
• Edge-connectivity augmentation of graphs over symmetric parity families (Q998390) (← links)
• Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs (Q1013291) (← links)
• An application of submodular flows (Q1119596) (← links)
• A minimum 3-connectivity augmentation of a graph (Q1208926) (← links)
• Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
• Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems (Q1406022) (← links)
• Combined connectivity augmentation and orientation problems (Q1410691) (← links)
• Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
• Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
• An algorithm for source location in directed graphs (Q1779694) (← links)
• Connectivity interdiction (Q1785279) (← links)
• A smallest augmentation to 3-connect a graph (Q1813979) (← links)
• The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
• Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) (Q2115870) (← links)
• On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
• Making bidirected graphs strongly connected (Q2300723) (← links)
• Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
• Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank (Q2404617) (← links)
• Augmenting forests to meet odd diameter requirements (Q2506822) (← links)
• Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846) (← links)
• A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION (Q2841986) (← links)
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph (Q2851459) (← links)
• The Generalized Terminal Backup Problem (Q2947440) (← links)
• Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph (Q2968515) (← links)
• Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
• A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
• BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS (Q3166746) (← links)
• A New Approach to Splitting-Off (Q3503862) (← 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)