Heuristic initialization for bipartite matching problems

DOI10.1145/1671970.1712656MaRDI QIDQ5406225zbMATH OpenOpenAlexFDO

Authors Johannes Langguth, Fredrik Manne, Peter Sanders

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1671970.1712656

zbMATH Keywords

heuristicsmatching

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
• Nonlinear bipartite matching
• Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
• Optimal Weighted Matchings for Rank-Deficient Sparse Matrices
• Parallel algorithms for bipartite matching problems on distributed memory computers

Cited in

(6)

• On efficient implicit OBDD-based algorithms for maximal matchings
• On Fault-Tolerant Low-Diameter Clusters in Graphs
• A distributed-memory algorithm for computing a heavy-weight perfect matching on bipartite graphs
• scientific article; zbMATH DE number 7651215 (Why is no real title available?)
• An Experimental Study of Algorithms for Online Bipartite Matching
• Parallel algorithms for bipartite matching problems on distributed memory computers

This page was built for publication: Heuristic initialization for bipartite matching problems

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