arXiv Open Access 2012

A Simplification of the MV Matching Algorithm and its Proof

Vijay V. Vazirani

Lihat Sumber

Abstrak

For all practical purposes, the Micali-Vazirani general graph maximum matching algorithm is still the most efficient known algorithm for the problem. The purpose of this paper is to provide a complete proof of correctness of the algorithm in the simplest possible terms; graph-theoretic machinery developed for this purpose also helps simplify the algorithm.

Topik & Kata Kunci

cs.DS

Penulis (1)

Vijay V. Vazirani

Format Sitasi

APA MLA BibTeX

Vazirani, V.V. (2012). A Simplification of the MV Matching Algorithm and its Proof. https://arxiv.org/abs/1210.4594

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2012
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓