Pages that link to "Item:Q5470828"

The following pages link to M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem (Q5470828):

Displaying 19 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)
• Isotropical linear spaces and valuated Delta-matroids (Q645957) (← links)
• Induction of M-convex functions by linking systems (Q997074) (← links)
• A note on M-convex functions on jump systems (Q2217499) (← links)
• Bisubmodular polyhedra, simplicial divisions, and discrete convexity (Q2339814) (← links)
• Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
• A weighted independent even factor algorithm (Q2429469) (← links)
• Even factors, jump systems, and discrete convexity (Q2519019) (← links)
• Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
• Discrete Concavity and Zeros of Polynomials (Q2851512) (← links)
• Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
• Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors (Q3439567) (← links)
• A survey of fundamental operations on discrete convex functions of various kinds (Q4999337) (← links)
• On basic operations related to network induction of discrete convex functions (Q4999338) (← links)
• Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)
• Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids (Q6180564) (← links)