Almost Exact Matchings

DOI10.1007/978-3-540-74208-1_21zbMATH Open1171.05397OpenAlexW2097214616MaRDI QIDQ3603472FDOQ3603472

Authors Raphael Yuster 

Publication date 17 February 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74208-1_21

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Almost exact matchings
• Maximum matching in graphs with an excluded minor
• Exact perfect matching in complete graphs
• NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
• scientific article; zbMATH DE number 4062621

Cited In (12)

• Overlap matching
• Randomized and Approximation Algorithms for Blue-Red Matching
• Exact arborescences, matchings and cycles
• Bi-criteria and approximation algorithms for restricted matchings
• Almost exact matchings
• The precise complexity of finding rainbow even matchings
• Exact covers via determinants
• Maximum matching in graphs with an excluded minor
• Almost semi-correspondence
• Exact perfect matching in complete graphs
• Almost similar configurations
• Random bichromatic matchings

This page was built for publication: Almost Exact Matchings

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