The following pages link to Augmentation Problems (Q4115167):
Displaying 41 items.
- Two-page book embedding of trees under vertex-neighborhood constraints (Q2367407) (← links)
- Augmenting forests to meet odd diameter requirements (Q2506822) (← links)
- Plane augmentation of plane graphs to meet parity constraints (Q2656724) (← links)
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846) (← links)
- A unified framework for bi(tri)connectivity and chordal augmentation (Q2841986) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
- Kernelization and complexity results for connectivity augmentation problems (Q3057175) (← links)
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
- Strongly Connected Spanning Subgraph for Almost Symmetric Networks (Q3132920) (← links)
- BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS (Q3166746) (← links)
- Extension to Even Triangulations (Q3449865) (← links)
- Minimizing Coordination Channels in Distributed Testing (Q3613091) (← links)
- An 0(log n) parallel algorithm for strong connectivity augmentation problem (Q3804208) (← links)
- Structured Connectivity Augmentation (Q4555048) (← links)
- Making Bipartite Graphs DM-Irreducible (Q4604647) (← links)
- A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
- Sparse Graphs and an Augmentation Problem (Q5041749) (← links)
- Globally Rigid Augmentation of Rigid Graphs (Q5043054) (← links)
- Better algorithms for minimum weight vertex-connectivity problems (Q5048953) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
- On triangulating planar graphs under the four-connectivity constraint (Q5056168) (← links)
- How to Secure Matchings Against Edge Failures (Q5090488) (← links)
- How to make a strongly connected digraph two-connected (Q5101433) (← links)
- Structured Connectivity Augmentation (Q5111243) (← links)
- Strongly connectable digraphs and non-transitive dice (Q5154618) (← links)
- How to Secure Matchings against Edge Failures (Q5157391) (← links)
- Approximation algorithms for graph augmentation (Q5204328) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
- Augmenting the Connectivity of Planar and Geometric Graphs (Q5300981) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
- Augmenting trees so that every three vertices lie on a cycle (Q5957303) (← links)
- A polyhedral approach to planar augmentation and related problems (Q6102325) (← links)
- Precedence-constrained arborescences (Q6109804) (← links)
- Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks (Q6139366) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Network augmentation for disaster‐resilience against geographically correlated failure (Q6179691) (← links)
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← 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)
