An algorithm for $(n-3)$-connectivity augmentation problem: jump system approach (Q414633): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C40
@@ Property / Mathematics Subject Classification ID: 05C40 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 05C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6033273
@@ Property / zbMATH DE Number: 6033273 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+connectivity augmentation
@@ Property / zbMATH Keywords: connectivity augmentation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+square-free 2-matching
@@ Property / zbMATH Keywords: square-free 2-matching / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+jump system
@@ Property / zbMATH Keywords: jump system / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+subcubic graph
@@ Property / zbMATH Keywords: subcubic graph / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2011.08.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2148517677
@@ Property / OpenAlex ID: W2148517677 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming and Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
+Normal rank
@@ Property / cites work @@
+Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
+Normal rank
@@ Property / cites work @@
+A matching problem with side conditions
@@ Property / cites work: A matching problem with side conditions / rank @@
+Normal rank
@@ Property / cites work @@
+Matching, matroids, and extensions
@@ Property / cites work: Matching, matroids, and extensions / rank @@
+Normal rank
@@ Property / cites work @@
+A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
+Normal rank
@@ Property / cites work @@
+Valuated matroids: A new look at the greedy algorithm
+Normal rank
@@ Property / cites work @@
+A greedy-algorithm characterization of valuated \(\Delta\)-matroids
+Normal rank
@@ Property / cites work @@
+Valuated matroids
@@ Property / cites work: Valuated matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Restricted \(t\)-matchings in bipartite graphs
@@ Property / cites work: Restricted \(t\)-matchings in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal edge-coverings of pairs of sets
@@ Property / cites work: Minimal edge-coverings of pairs of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Directed vertex-connectivity augmentation
@@ Property / cites work: Directed vertex-connectivity augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+Submodular functions and optimization.
@@ Property / cites work: Submodular functions and optimization. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster scaling algorithms for general graph matching problems
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum skew-symmetric flows and matchings
@@ Property / cites work: Maximum skew-symmetric flows and matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Finding maximum square-free 2-matchings in bipartite graphs
+Normal rank
@@ Property / cites work @@
+On Four-Connecting a Triconnected Graph
@@ Property / cites work: On Four-Connecting a Triconnected Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Smallest Augmentation to Biconnect a Graph
+Normal rank
@@ Property / cites work @@
+Q2721988
@@ Property / cites work: Q2721988 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472504
@@ Property / cites work: Q4472504 / rank @@
+Normal rank
@@ Property / cites work @@
+Independence free graphs and vertex connectivity augmentation
+Normal rank
@@ Property / cites work @@
+On the optimal vertex-connectivity augmentation
@@ Property / cites work: On the optimal vertex-connectivity augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the vertex-connectivity augmentation problem
+Normal rank
@@ Property / cites work @@
+A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
+Normal rank
@@ Property / cites work @@
+Operations on M‐Convex Functions on Jump Systems
+Normal rank
@@ Property / cites work @@
+Even factors, jump systems, and discrete convexity
+Normal rank
@@ Property / cites work @@
+On shredders and vertex connectivity augmentation
@@ Property / cites work: On shredders and vertex connectivity augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+The membership problem in jump systems
@@ Property / cites work: The membership problem in jump systems / rank @@
+Normal rank
@@ Property / cites work @@
+On Maximum Cost $K_{t,t}$‐Free <i>t</i>‐Matchings of Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Convexity and Steinitz's exchange property
@@ Property / cites work: Convexity and Steinitz's exchange property / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete Convex Analysis
@@ Property / cites work: Discrete Convex Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
+Normal rank
@@ Property / cites work @@
+Combinatorial algorithms for matchings, even factors and square-free 2-factors
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for minimum-cost vertex-connectivity problems
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems
+Normal rank
@@ Property / cites work @@
+A Weighted <i>k<sub>t, t</sub></i>-Free <i>t</i>-Factor Algorithm for Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+A Short Proof of the Factor Theorem for Finite Graphs
+Normal rank
@@ Property / cites work @@
+Augmenting undirected node-connectivity by one
@@ Property / cites work: Augmenting undirected node-connectivity by one / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921669
@@ Property / cites work: Q2921669 / rank @@
+Normal rank
@@ Property / cites work @@
+A smallest augmentation to 3-connect a graph
@@ Property / cites work: A smallest augmentation to 3-connect a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Pfaffian forms and \(\Delta\)-matroids
@@ Property / cites work: Pfaffian forms and \(\Delta\)-matroids / rank @@
+Normal rank
@@ Property / cites work @@
+\(\Delta\)-matroids with the strong exchange conditions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:414633

An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633): Difference between revisions

Latest revision as of 05:10, 5 July 2024

Statements

Sitelinks

Mathematics(1 entry)