scientific article; zbMATH DE number 515942

MaRDI QIDQ4283460zbMATH OpenFDO

Authors R. Bruce Mattingly, Nathan P. Ritchey

Publication date 20 June 1994

zbMATH Keywords

computational experimentsmatching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 515941
• Balanced network flows. VIII. A revised theory of phase‐ordered algorithms and the O( $\bf\it\sqrt{n}m$ log(n²/m)/log n) bound for the nonbipartite cardinality matching problem
• The weighted matching approach to maximum cardinality matching
• Faster scaling algorithms for general graph matching problems
• scientific article; zbMATH DE number 795216

Cited in

(2)

• scientific article; zbMATH DE number 515941 (Why is no real title available?)
• The weighted matching approach to maximum cardinality 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 Q4283460)