Implementing weighted b-matching algorithms

DOI10.1145/351827.384250MaRDI QIDQ5463403zbMATH OpenOpenAlexWikidataFDO

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

Recommendations

• A memetic algorithm to schedule planned maintenance for the national grid
• Implementation of O ( nm log n ) weighted matchings in general graphs
• Efficient approximation algorithms for weighted b-matching
• Computing Minimum-Weight Perfect Matchings
• Data structures for weighted matching and extensions to \(b\)-matching and \(f\)-factors

Cited in

(7)

• Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation
• Clustering with \(r\)-regular graphs
• Efficient approximation algorithms for weighted b-matching
• Approximation algorithms in combinatorial scientific computing
• A memetic algorithm to schedule planned maintenance for the national grid
• Implementation of O ( nm log n ) weighted matchings in general graphs
• Engineering hypergraph b-matching algorithms

Describes a project that uses

Uses Software

• Blossom IV

This page was built for publication: Implementing weighted b-matching algorithms

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