Pages that link to "Item:Q3989009"
From MaRDI portal
The following pages link to Augmenting Graphs to Meet Edge-Connectivity Requirements (Q3989009):
Displayed 33 items.
- Submodular functions in graph theory (Q686469) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Network design with edge-connectivity and degree constraints (Q839639) (← links)
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (Q848841) (← links)
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs (Q860392) (← links)
- On shredders and vertex connectivity augmentation (Q924546) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- Minimizing a monotone concave function with laminar covering constraints (Q943837) (← links)
- An algorithm to increase the node-connectivity of a digraph by one (Q955325) (← 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)
- Inapproximability of survivable networks (Q1019191) (← links)
- Vertex fusion under distance constraints (Q1039434) (← links)
- On a theorem of Mader (Q1197013) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
- Structures of subpartitions related to a submodular function minimization (Q1365312) (← links)
- Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems (Q1406022) (← links)
- On the minimum local-vertex-connectivity augmentation in graphs (Q1406041) (← links)
- Edge splitting and connectivity augmentation in directed hypergraphs. (Q1417568) (← links)
- Splitting off edges between two subsets preserving the edge-connectivity of the graph. (Q1422410) (← links)
- Increasing digraph arc-connectivity by arc addition, reversal and complement (Q1613410) (← links)
- Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
- On the minor-minimal 2-connected graphs having a fixed minor (Q1827674) (← links)
- Polyhedral structure of submodular and posi-modular systems (Q1841887) (← links)
- Covering symmetric semi-monotone functions (Q2462361) (← links)
- Edge-splittings preserving local edge-connectivity of graphs (Q2482096) (← links)
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846) (← links)
- A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows (Q2785397) (← links)
- A New Approach to Splitting-Off (Q3503862) (← links)
- (Q4256090) (← links)
- Highly edge-connected detachments of graphs and digraphs (Q4808407) (← links)
- Bipartition constrained edge-splitting in directed graphs (Q5954237) (← links)
- Augmenting trees so that every three vertices lie on a cycle (Q5957303) (← links)