On stable flows and preflows

DOI10.1134/s0965542523030077arXiv2209.00614OpenAlexW4367662838MaRDI QIDQ6039791

Alexander V. Karzanov

Publication date: 23 May 2023

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.00614

zbMATH Keywords

stable allocationpreflowquasi-flowstable flow in network

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Stable flows over time
• On stable matchings and flows
• A data structure for dynamic trees
• Faster algorithms for stable allocation problems
• A necessary and sufficient condition for the existence of a complete stable matching
• An efficient algorithm for the “stable roommates” problem
• Self-adjusting binary search trees
• Erratum: The Stable Allocation (or Ordinal Transportation) Problem
• College Admissions and the Stability of Marriage
• New and simple algorithms for stable flow problems

This page was built for publication: On stable flows and preflows