A short note on matching algorithms

DOI10.1007/BFB0121094MaRDI QIDQ3716816zbMATH OpenOpenAlexFDO

Authors Ulrich Derigs

Publication date 1986

Published in Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0121094

zbMATH Keywords

computational complexitymatching algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Polytopes and polyhedra (52Bxx) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(2)

• scientific article; zbMATH DE number 6863589 (Why is no real title available?)
• Building and combining matching algorithms

This page was built for publication: A short note on matching algorithms

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