Sciweavers

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

89

NETWORKS
2008

118views Computer Networks» more NETWORKS 2008»

On a graph coloring problem arising from discrete tomography

15 years 3 months ago

On a graph coloring problem arising from discrete tomography

Download www.lri.fr

Cédric Bentz, Marie-Christine Costa, Domini

Real-time Traffic

Computer Networks | NETWORKS 2008 |

claim paper

Related Content

» Using graphs for some discrete tomography problems

» On the Complexity of Some Colorful Problems Parameterized by Treewidth

» On the Minimum Load Coloring Problem

» The Complexity of Bottleneck Labeled Graph Problems

» A Network Flow Algorithm for Binary Image Reconstruction from Few Projections

» Convergent transfer subgraph characterization and computation

» Switch Scheduling via Randomized Edge Coloring

» Functional compression through graph coloring

» Observable Graphs

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	NETWORKS
Authors	Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries

Comments (0)