Implementing weighted b-matching algorithms

DOI10.1145/351827.384250zbMath1071.68562OpenAlexW2158638971WikidataQ57013346 ScholiaQ57013346MaRDI QIDQ5463403

Alexander Schwartz, Matthias Müller-Hannemann

Publication date: 4 August 2005

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

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

zbMATH Keywords

\(b\)-matchingblossom algorithmoperation counting

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items

Clustering with \(r\)-regular graphs ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Efficient Approximation Algorithms for Weighted $b$-Matching ⋮ Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation

Uses Software

• Blossom IV