Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

WG
2004
Springer

favoriteEmaildiscussreport

102views Theoretical Computer Science» more WG 2004»

Coloring a Graph Using Split Decomposition

13 years 9 months ago

Coloring a Graph Using Split Decomposition

Download www.cecm.sfu.ca

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(n2 m) 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 Ck for some k ≥ 3.

Michaël Rao

Real-time Traffic

Chromatic Number | Computer Science | Split Decomposition | Weighted Clique Number | WG 2004 |

claim paper

Related Content

» Layout Decomposition Approaches for Double Patterning Lithography

» Layout decomposition for double patterning lithography

» Dynamic Distance Hereditary Graphs Using Split Decomposition

» Algorithmic Graph Minor Theory Decomposition Approximation and Coloring

» Live Range Splitting in a Graph Coloring Register Allocator

» Hjoin decomposable graphs and algorithms with runtime single exponential in rankwidth

» Edge Coloring and Decompositions of Weighted Graphs

» Circle graphs and monadic secondorder logic

» Partitioning Histopathological Images An Integrated Framework for Supervised ColorTexture ...

Post Info
More Details (n/a)

Added	03 Jul 2010
Updated	03 Jul 2010
Type	Conference
Year	2004
Where	WG
Authors	Michaël Rao

Comments (0)