An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
From MaRDI portal
Publication:414633
DOI10.1016/j.jctb.2011.08.007zbMath1241.05061OpenAlexW2148517677MaRDI QIDQ414633
Yusuke Kobayashi, Kristóf Bérczi
Publication date: 11 May 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2011.08.007
Related Items (13)
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles ⋮ Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ Decomposition theorems for square-free 2-matchings in bipartite graphs ⋮ Triangle-free 2-matchings and M-concave functions on jump systems ⋮ Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids ⋮ A proof of Cunningham's conjecture on restricted subgraphs and jump systems ⋮ A note on M-convex functions on jump systems ⋮ A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges ⋮ Two disjoint shortest paths problem with non-negative edge length ⋮ Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs ⋮ A survey of fundamental operations on discrete convex functions of various kinds ⋮ On basic operations related to network induction of discrete convex functions ⋮ Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
Cites Work
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
- Convexity and Steinitz's exchange property
- An approximation algorithm for minimum-cost vertex-connectivity problems
- Combinatorial algorithms for matchings, even factors and square-free 2-factors
- Valuated matroids: A new look at the greedy algorithm
- On shredders and vertex connectivity augmentation
- A matching problem with side conditions
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids
- Valuated matroids
- Some simplified NP-complete graph problems
- Directed vertex-connectivity augmentation
- \(\Delta\)-matroids with the strong exchange conditions
- The membership problem in jump systems
- A note on the vertex-connectivity augmentation problem
- Restricted \(t\)-matchings in bipartite graphs
- Independence free graphs and vertex connectivity augmentation
- Pfaffian forms and \(\Delta\)-matroids
- A smallest augmentation to 3-connect a graph
- Matching, matroids, and extensions
- Maximum skew-symmetric flows and matchings
- On the optimal vertex-connectivity augmentation
- Minimal edge-coverings of pairs of sets
- Finding maximum square-free 2-matchings in bipartite graphs
- Even factors, jump systems, and discrete convexity
- Submodular functions and optimization.
- Augmenting undirected node-connectivity by one
- Finding a Smallest Augmentation to Biconnect a Graph
- A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
- Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems
- Augmentation Problems
- Faster scaling algorithms for general graph matching problems
- Discrete Convex Analysis
- On Four-Connecting a Triconnected Graph
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Operations on M‐Convex Functions on Jump Systems
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- Integer Programming and Combinatorial Optimization
- A Short Proof of the Factor Theorem for Finite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
