Abstract
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular we present an O(n2in) algorithm to compute the chromatic number for all those graphs having a split decomposition in which every prime graph is an induced subgraph of either a Ck or a C̄k for some k ≥ 3. © Springer-Verlag 2004.
Cite
CITATION STYLE
APA
Rao, M. (2004). Coloring a graph using split decomposition. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3353, 129–141. https://doi.org/10.1007/978-3-540-30559-0_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free