Chudnovsky, M, Trotignon, N, Trunck, T et al. (1 more author) (2015) Coloring perfect graphs with no balanced skew-partitions. Journal of Combinatorial Theory, Series B, 115. pp. 26-65. ISSN 0095-8956
Abstract
We present an O(n5) algorithm that computes a maximum stable set of any perfect graph with no balanced skew-partition. We present O(n7) time algorithm that colors them.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2015, Elsevier. This is an author produced version of a paper published in Journal of Combinatorial Theory, Series B. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Perfect graphs; berge graphs; coloring; maximum stable set; 2-join; skew partition; homogeneous pair |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 24 Apr 2015 11:24 |
Last Modified: | 14 May 2019 15:52 |
Published Version: | http://dx.doi.org/10.1016/j.jctb.2015.04.007 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.jctb.2015.04.007 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:85309 |