A Formal Analysis of RANKING
Logic in Computer Science
2023-03-01 v2 Data Structures and Algorithms
Abstract
We describe a formal correctness proof of RANKING, an online algorithm for online bipartite matching. An outcome of our formalisation is that it shows that there is a gap in all combinatorial proofs of the algorithm. Filling that gap constituted the majority of the effort which went into this work. This is despite the algorithm being one of the most studied algorithms and a central result in theoretical computer science. This gap is an example of difficulties in formalising graphical arguments which are ubiquitous in the theory of computing.
Keywords
Cite
@article{arxiv.2302.13747,
title = {A Formal Analysis of RANKING},
author = {Mohammad Abdulaziz and Christoph Madlener},
journal= {arXiv preprint arXiv:2302.13747},
year = {2023}
}