Pages that link to "Item:Q5712468"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712468):
Displaying 9 items.
- Triangle-free 2-matchings and M-concave functions on jump systems (Q401132) (← links)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657) (← links)
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
- Induction of M-convex functions by linking systems (Q997074) (← links)
- A note on M-convex functions on jump systems (Q2217499) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors (Q3439567) (← links)
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids (Q6180564) (← links)