Fine-tuning decomposition theorem for maximum weight bipartite matching

DOI10.1007/978-3-319-06089-7_22zbMATH Open1406.05100OpenAlexW103840660MaRDI QIDQ5410652FDOQ5410652

Authors: 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

Recommendations

• A modified decomposition algorithm for maximum weight bipartite matching and its experimental evaluation
• A decomposition theorem for maximum weight bipartite matchings
• New algorithms for maximum weight matching and a decomposition theorem
• Publication:4938785
• Maximum weight bipartite matching in matrix multiplication time

zbMATH Keywords

graph algorithmgraph decompositionminimum weight vertex covermaximum weight bipartite matching

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Fcfs infinite bipartite matching of servers and customers
• A filtering technique for all pairs approximate parameterized string matching
• Weighted approximate parameterized string matching
• New algorithms for maximum weight matching and a decomposition theorem
• A modified decomposition algorithm for maximum weight bipartite matching and its experimental evaluation
• A decomposition theorem for maximum weight bipartite matchings

This page was built for publication: Fine-tuning decomposition theorem for maximum weight bipartite matching

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