Constrained Matching Problems in Bipartite Graphs
From MaRDI portal
Publication:3167638
DOI10.1007/978-3-642-32147-4_31zbMath1370.05172OpenAlexW7671684MaRDI QIDQ3167638
Georgios Stamoulis, Monaldo Mastrolilli
Publication date: 2 November 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_31
Integer programming (90C10) Multi-objective and goal programming (90C29) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (2)
Minimum <scp>color‐degree</scp> perfect b‐matchings ⋮ Isomorphic unordered labeled trees up to substitution ciphering
This page was built for publication: Constrained Matching Problems in Bipartite Graphs
