Pages that link to "Item:Q3989009"
From MaRDI portal
The following pages link to Augmenting Graphs to Meet Edge-Connectivity Requirements (Q3989009):
Displayed 50 items.
- A note on minimizing submodular functions (Q293366) (← links)
- Characterizing and recognizing generalized polymatroids (Q403645) (← links)
- Testing \(k\)-edge-connectivity of digraphs (Q469635) (← links)
- Augmenting edge-connectivity between vertex subsets (Q472470) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- Splitting off operation for binary matroids and its applications (Q659753) (← links)
- Connectivity augmentation in planar straight line graphs (Q661949) (← links)
- 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)
- 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)
- 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)
- Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
- Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
- Connectivity interdiction (Q1785279) (← links)
- On the minor-minimal 2-connected graphs having a fixed minor (Q1827674) (← links)
- Polyhedral structure of submodular and posi-modular systems (Q1841887) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- Vertex-weighted realizations of graphs (Q2286737) (← 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)
- Degree sequence for \(k\)-arc strongly connected multiple digraphs (Q2412864) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- A unifying approach to splitting-off (Q2448935) (← links)
- Covering symmetric semi-monotone functions (Q2462361) (← links)
- Edge-splittings preserving local edge-connectivity of graphs (Q2482096) (← links)