An unfeasible matching problem

DOI10.1007/BF01933174zbMath0738.68045OpenAlexW2049514974MaRDI QIDQ1182611

Andrzej Lingas

Publication date: 28 June 1992

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933174

zbMATH Keywords

NP-completenessweighted matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Sorting shuffled monotone sequences
• NP-complete stable matching problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An unfeasible matching problem