Dynamic matchings and quasidynamic fractional matchings. I

DOI10.1002/NET.3230130407zbMATH Open0526.90089OpenAlexW4233636575MaRDI QIDQ3040950FDOQ3040950

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Paths, Trees, and Flowers
• Title not available (Why is that?)
• Maximum matching and a polyhedron with 0,1-vertices
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Optimal set partitioning, matchings and lagrangian duality

Cited In (1)

• Kirkman triple systems of order 21 with nontrivial automorphism group

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

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