Parametric stable marriage and minimum cuts

DOI10.1016/0020-0190(89)90204-4zbMath0699.90007OpenAlexW2039408110MaRDI QIDQ913621

Dan Gusfield, Robert W. Irving

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90204-4

zbMATH Keywords

parametric optimizationstable marriageminimum cutscontinuum of possible compromisesparametric network flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10) Individual preferences (91B08) Social choice (91B14)

Related Items (5)

Parametric multiple sequence alignment and phylogeny construction ⋮ Parametric stable marriage and minimum cuts ⋮ Transitions in geometric minimum spanning trees ⋮ A faster parametric minimum-cut algorithm ⋮ Network flow and 2-satisfiability

Cites Work

• Parametric stable marriage and minimum cuts
• A fast algorithm for the generalized parametric minimum cut problem and applications
• The Complexity of Counting Stable Marriages
• Parametric Combinatorial Computing and a Problem of Program Module Distribution
• A new approach to the maximum-flow problem
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Critical Load Factors in Two-Processor Distributed Systems
• A Fast Parametric Maximum Flow Algorithm and Applications
• College Admissions and the Stability of Marriage
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parametric stable marriage and minimum cuts