scientific article; zbMATH DE number 2114098

MaRDI QIDQ4825844zbMATH OpenFDO

Authors Peter Czimmermann

Publication date 5 November 2004

zbMATH Keywords

graph algorithmsperfect matchingirregularity measure

Mathematics Subject Classification ID

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

Recommendations

• Optimum matchings in weighted bipartite graphs
• Maximum matching in regular and almost regular graphs
• A new class of heuristic algorithms for weighted perfect matching
• The cost of perfection for matchings in graphs
• scientific article; zbMATH DE number 4116586

Cited in

(5)

• Maximum matchings in regular graphs of high girth
• Perfect matchings in highly cyclically connected regular graphs
• On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
• The cost of perfection for matchings in graphs
• On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching

This page was built for publication:

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