Dynamic matchings and quasidynamic fractional matchings. II

DOI10.1002/net.3230130408zbMath0526.90090OpenAlexW2051746663MaRDI QIDQ3040951

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

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

Related Items

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

Cites Work

• Perfect triangle-free 2-matchings
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item