Combinatorics and algorithms for augmenting graphs
Discrete Mathematics
2014-11-03 v1 Data Structures and Algorithms
Combinatorics
Abstract
The notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is a special case of the more general maximum independent set (MIS) problem. Recently, the augmenting graph approach has been successfully applied to solve MIS in various other special cases. However, our knowledge of augmenting graphs is still very limited, and we do not even know what the minimal infinite classes of augmenting graphs are. In the present paper, we find an answer to this question and apply it to extend the area of polynomial-time solvability of the maximum independent set problem.
Keywords
Cite
@article{arxiv.1410.8774,
title = {Combinatorics and algorithms for augmenting graphs},
author = {Konrad K. Dabrowski and Dominique de Werra and Vadim V. Lozin and Viktor Zamaraev},
journal= {arXiv preprint arXiv:1410.8774},
year = {2014}
}
Comments
13 pages, 5 figures