Even factors, jump systems, and discrete convexity
From MaRDI portal
Publication:2519019
Recommendations
Cites work
- \(\Delta\)-matroid and jump system
- \(\Delta\)-matroids with the strong exchange conditions
- A Combinatorial Algorithm to Find a Maximum Even Factor
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids
- A weighted even factor algorithm
- Algebraic algorithms for matching and matroid problems
- 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
- Finding optimal minors of valuated bimatroids
- Greedy algorithm and symmetric matroids
- scientific article; zbMATH DE number 6381750 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- Matching, matroids, and extensions
- Matroid Intersection
- Matroid intersection algorithms
- On minimal strong blocks
- On the maximum even factor in weakly symmetric graphs
- Operations on M‐Convex Functions on Jump Systems
- Paths, Trees, and Flowers
- Pfaffian forms and \(\Delta\)-matroids
- Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems
- Pseudomatroids
- Some combinatorial properties of discriminants in metric vector spaces
- Submodular functions and optimization.
- The membership problem in jump systems
- The optimal path-matching problem
- Valuated matroids
- Valuated matroids: A new look at the greedy algorithm
Cited in
(19)- The membership problem in jump systems
- Improved algorithms for even factors and square-free simple \(b\)-matchings
- A note on M-convex functions on jump systems
- A weighted independent even factor algorithm
- Recent developments in discrete convex analysis
- Triangle-free 2-matchings and M-concave functions on jump systems
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- An algorithm for finding a maximum t-matching excluding complete partite subgraphs
- scientific article; zbMATH DE number 2147934 (Why is no real title available?)
- A survey of fundamental operations on discrete convex functions of various kinds
- On basic operations related to network induction of discrete convex functions
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
- Optimal general factor problem and jump system intersection
- Sufficient conditions for even factors in graphs
- Signless Laplacian spectral conditions for even factors in graphs
- Title not available (Why is no real title available?)
- \(\Delta\)-matroid and jump system
This page was built for publication: Even factors, jump systems, and discrete convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2519019)
