Pages that link to "Item:Q1091147"
From MaRDI portal
The following pages link to Edge-connectivity augmentation problems (Q1091147):
Displayed 24 items.
- Covering symmetric supermodular functions by uniform hypergraphs (Q598465) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← 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)
- 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)
- Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
- An algorithm for source location in directed graphs (Q1779694) (← links)
- A smallest augmentation to 3-connect a graph (Q1813979) (← links)
- Augmenting forests to meet odd diameter requirements (Q2506822) (← links)
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846) (← links)
- A New Approach to Splitting-Off (Q3503862) (← links)
- Augmenting trees so that every three vertices lie on a cycle (Q5957303) (← links)