Induction of M-convex functions by linking systems
Discrete Applied Mathematics
Even factors, jump systems, and discrete convexity
Journal of Combinatorial Theory Series B
Discrete Concavity and the Half-Plane Property
SIAM Journal on Discrete Mathematics
Isotropical linear spaces and valuated Delta-matroids
Journal of Combinatorial Theory Series A
Neighbor Systems and the Greedy Algorithm
SIAM Journal on Discrete Mathematics
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach
Journal of Combinatorial Theory Series B
A proof of Cunningham's conjecture on restricted subgraphs and jump systems
Journal of Combinatorial Theory Series B
A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
Discrete Optimization
| Hi-index | 0.01 |
The concept of M-convex functions is generalized for functions defined on constant-parity jump systems. M-convex functions arise from minimum weight perfect $b$-matchings and from a separable convex function (sum of univariate convex functions) on the degree sequences of an undirected graph. As a generalization of a recent result of Apollonio and Seb{o} for the minsquare factor problem, a local optimality criterion is given for minimization of an M-convex function subject to a component sum constraint.