Stable Sets and Graphs with no Even Holes
Combinatorics
2015-01-06 v3
Abstract
We develop decomposition/composition tools for efficiently solving maximum weight stable sets problems as well as for describing them as polynomially sized linear programs (using "compact systems"). Some of these are well-known but need some extra work to yield polynomial "decomposition schemes". We apply the tools to graphs with no even hole and no cap. A hole is a chordless cycle of length greater than three and a cap is a hole together with an additional node that is adjacent to two adjacent nodes of the hole and that has no other neighbors on the hole.
Cite
@article{arxiv.1306.5594,
title = {Stable Sets and Graphs with no Even Holes},
author = {Michele Conforti and Bert Gerards and Kanstantsin Pashkovich},
journal= {arXiv preprint arXiv:1306.5594},
year = {2015}
}
Comments
substantial changes