Combinatorics and Algorithms for Augmenting Graphs

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.

[1]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[2]  Najiba Sbihi,et al.  Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[3]  Ingo Schiermeyer,et al.  New sufficient conditions for α-redundant vertices , 2015, Discret. Math..

[4]  V. E. Alekseev,et al.  Polynomial algorithm for finding the largest independent sets in graphs without forks , 2004, Discret. Appl. Math..

[5]  Vadim V. Lozin,et al.  On finding augmenting graphs , 2008, Discret. Appl. Math..

[6]  L. Lovász.  Matching Theory (North-Holland mathematics studies) , 1986 .

[7]  Vadim V. Lozin,et al.  The Maximum Independent Set Problem and Augmenting Graphs , 2005 .

[8]  Konrad Dabrowski,et al.  New results on maximum induced matchings in bipartite graphs and beyond , 2013, Theor. Comput. Sci..

[9]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.

[10]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Dieter Rautenbach,et al.  Some results on graphs without long induced paths , 2003, Inf. Process. Lett..

[12]  A. Tamura,et al.  A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph , 2001 .

[13]  Vadim V. Lozin,et al.  Augmenting chains in graphs without a skew star , 2006, J. Comb. Theory, Ser. B.

[14]  Raffaele Mosca.  Stable Sets in Certain P6-free Graphs , 1999, Discret. Appl. Math..