A Simple Analysis of Ranking in General Graphs
Data Structures and Algorithms
2025-11-13 v1
Abstract
We provide a simple combinatorial analysis of the Ranking algorithm, originally introduced in the seminal work by Karp, Vazirani, and Vazirani [KVV90], demonstrating that it achieves a -approximate matching for general graphs for .
Cite
@article{arxiv.2511.08801,
title = {A Simple Analysis of Ranking in General Graphs},
author = {Mahsa Derakhshan and Mohammad Roghani and Mohammad Saneian and Tao Yu},
journal= {arXiv preprint arXiv:2511.08801},
year = {2025}
}