Dynamic matchings and quasidynamic fractional matchings. II

DOI10.1002/NET.3230130408zbMATH Open0526.90090OpenAlexW2051746663MaRDI QIDQ3040951FDOQ3040951

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Paths, Trees, and Flowers
• Title not available (Why is that?)
• Maximum matching and a polyhedron with 0,1-vertices
• Title not available (Why is that?)
• 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)