Matchings in Node-Weighted Convex Bipartite Graphs

DOI10.1287/ijoc.1070.0232zbMath1243.05200OpenAlexW2036353623MaRDI QIDQ2901005

Irit Katriel

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1070.0232

zbMATH Keywords

algorithmsschedulingperfect matchinggraphs matching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Related Items (4)

Dynamic matchings in left vertex weighted convex bipartite graphs ⋮ Fast Dynamic Weight Matchings in Convex Bipartite Graphs ⋮ Linear-time algorithm for the paired-domination problem in convex bipartite graphs ⋮ Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs

This page was built for publication: Matchings in Node-Weighted Convex Bipartite Graphs