Classified rank-maximal matchings and popular matchings -- algorithms and hardness

DOI10.1007/978-3-030-30786-8_19OpenAlexW2972859010MaRDI QIDQ2301548

Meghana Nasre, Nada Pulath, Prajakta Nimbhorkar

Publication date: 24 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-30786-8_19

zbMATH Keywords

bipartite graphspopularityrank-maximalitymatchings under classifications

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Classified rank-maximal matchings and popular matchings -- algorithms and hardness