Sciweavers

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

7

DM
2010

favoriteEmaildiscussreport

65views more DM 2010»

Decomposition of sparse graphs, with application to game coloring number

13 years 4 months ago

Decomposition of sparse graphs, with application to game coloring number

Download www.ncts.ncku.edu.tw

Mickaël Montassier, Arnaud Pêcher, Andr

Real-time Traffic

DM 2010 |

claim paper

Related Content

» Graph coloring in the estimation of sparse derivative matrices Instances and applications

» Graph Searching Elimination Trees and a Generalization of Bandwidth

» Fast signal analysis and decomposition on graphs using the Sparse Matrix Transform

» Distributed Algorithms for DCOP A GraphicalGameBased Approach

» Digraph measures Kelly decompositions games and orderings

» Hypertree Decompositions Structure Algorithms and Applications

» Vertex Cover in Graphs with Locally Few Colors

» Combinatorial approach to the interpolation method and scaling limits in sparse random gra...

» Colibri fast mining of large static and dynamic graphs

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DM
Authors	Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu

Comments (0)