Dynamic matchings and quasidynamic fractional matchings. II

DOI10.1002/NET.3230130408MaRDI QIDQ3040951zbMATH OpenOpenAlexFDO

Authors James B. Orlin

Publication date 1983

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230130408

zbMATH Keywords

weighted matchingEdmonds' blossom algorithmdynamic matching problemQ-matching problemquasidynamic fractional matchingvertex-disjoint circuits

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3496213 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Maximum matching and a polyhedron with 0,1-vertices
• Paths, Trees, and Flowers
• Perfect triangle-free 2-matchings

Cited in

(2)

• An extension of matching theory
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication: Dynamic matchings and quasidynamic fractional matchings. II

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