Integer Programming and Combinatorial Optimization
From MaRDI portal
Publication:5712468
DOI10.1007/b97946zbMath1093.05509OpenAlexW2484779063MaRDI QIDQ5712468
Publication date: 23 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97946
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Triangle-free 2-matchings and M-concave functions on jump systems ⋮ An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids ⋮ 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 ⋮ A note on M-convex functions on jump systems ⋮ The maximum vertex coverage problem on bipartite graphs ⋮ Induction of M-convex functions by linking systems ⋮ Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors
This page was built for publication: Integer Programming and Combinatorial Optimization