Dynamic rank-maximal matchings

DOI10.1007/978-3-319-62389-4_36zbMath1434.68368arXiv1704.00899OpenAlexW2607035390MaRDI QIDQ2412427

Prajakta Nimbhorkar, Arvind Rameshwar V.

Publication date: 23 October 2017

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

This page was built for publication: Dynamic rank-maximal matchings