Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching

DOI10.1007/978-3-319-06089-7_22zbMath1406.05100OpenAlexW103840660MaRDI QIDQ5410652

Shibsankar Das, Kalpesh Kapoor

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06089-7_22

zbMATH Keywords

graph algorithmgraph decompositionminimum weight vertex covermaximum weight bipartite matching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (2)

Weighted approximate parameterized string matching ⋮ A Filtering Technique for All Pairs Approximate Parameterized String Matching

This page was built for publication: Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching