Matchings in node-weighted convex bipartite graphs

DOI10.1287/IJOC.1070.0232zbMATH Open1243.05200OpenAlexW2036353623MaRDI QIDQ2901005FDOQ2901005

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)

Cited In (10)

• Semi-matchings for bipartite graphs and load balancing
• An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
• Optimum matchings in weighted bipartite graphs
• Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs
• Dynamic Matchings in Left Weighted Convex Bipartite Graphs
• Fast Dynamic Weight Matchings in Convex Bipartite Graphs
• Linear-time algorithm for the paired-domination problem in convex bipartite graphs
• Dynamic matchings in left vertex weighted convex bipartite graphs
• Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
• Competitive weighted matching in transversal matroids

This page was built for publication: Matchings in node-weighted convex bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901005)