Proceedings
2018 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing
Approximation algorithms for maximum matchings in undirected graphs
Pages 56 - 65
Abstract
We propose heuristics for approximating the maximum cardinality matching on undirected graphs. Our heuristics are based on the theoretical body of a certain type of random graphs, and are made practical for real-life ones. The idea is based on judiciously selecting a subgraph of a given graph and obtaining a maximum cardinality matching on this subgraph. We show that the heuristics have an approximation guarantee of around 0.866 — log(n)/n for a graph with n vertices. Experiments for verifying the theoretical results in practice are provided.
Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In
2018 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing
Pages: 56 - 65
Editors: Fredrik Manne, University of Bergen, Norway, Peter Sanders, Karlsruhe Institute of Technology, Germany, and Sivan Toledo, Tel-Aviv University, Israel
ISBN (Online): 978-1-61197-521-5
Copyright
© 2018 by the Society for Industrial and Applied Mathematics.
History
Published online: 7 August 2018
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Scaling matrices and counting the perfect matchings in graphsDiscrete Applied Mathematics, Vol. 308 | 1 Feb 2022
- Temporal Matching on Geometric Graph DataAlgorithms and Complexity | 4 May 2021
- Effective Heuristics for Matchings in HypergraphsAnalysis of Experimental Algorithms | 14 November 2019
View Options
View options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].