| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656735 | Journal of Combinatorial Theory, Series B | 2015 | 40 Pages |
Abstract
We present an O(n5)O(n5) algorithm that computes a maximum stable set of any perfect graph with no balanced skew-partition. We present O(n7)O(n7) time algorithm that colors them.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck, Kristina Vušković,