A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
From MaRDI portal
(Redirected from Publication:429657)
A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
Recommendations
Cites work
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids
- A matching problem with side conditions
- A weighted \(K_{t,t}\)-free \(t\)-factor algorithm for bipartite graphs
- Combinatorial algorithms for matchings, even factors and square-free 2-factors
- Convexity and Steinitz's exchange property
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Discrete Convex Analysis
- Even factors, jump systems, and discrete convexity
- Faster scaling algorithms for general graph matching problems
- Finding maximum square-free 2-matchings in bipartite graphs
- Integer Programming and Combinatorial Optimization
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- Matching, matroids, and extensions
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
- Operations on M‐Convex Functions on Jump Systems
- Pfaffian forms and \(\Delta\)-matroids
- Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems
- Restricted \(t\)-matchings in bipartite graphs
- Submodular functions and optimization.
- The membership problem in jump systems
- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
- Valuated matroids
- Valuated matroids: A new look at the greedy algorithm
- \(\Delta\)-matroids with the strong exchange conditions
Cited in
(20)- Triangle-free 2-matchings and M-concave functions on jump systems
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
- An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs
- Positive planar satisfiability problems under 3-connectivity constraints
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- When the Gomory-chvátal closure coincides with the integer hull
- A fast scaling algorithm for the weighted triangle-free 2-matching problem
- A fast scaling algorithm for the weighted triangle-free 2-matching problem
- Triangle-free 2-matchings revisited
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- scientific article; zbMATH DE number 4062620 (Why is no real title available?)
- Finding triangle-free 2-factors in general graphs
- Triangle-free 2-matchings revisited
- Maximum Cardinality Simple 2-matchings in Subcubic Graphs
This page was built for publication: A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429657)
