Dynamic matchings and quasidynamic fractional matchings. I

DOI10.1002/net.3230130407zbMath0526.90089OpenAlexW4233636575MaRDI QIDQ3040950

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.3230130407

zbMATH Keywords

polynomial time algorithmdynamic graphfinite directed graphdynamic matching problemtime-expanded infinite network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (1)

Kirkman triple systems of order 21 with nontrivial automorphism group

Cites Work

• Unnamed Item
• Optimal set partitioning, matchings and lagrangian duality
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices

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