Sciweavers

88

NETWORKS
2008

316views Computer Networks» more NETWORKS 2008»

The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases

14 years 24 days ago

The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases

Download pluto.mscc.huji.ac.il

Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...

claim paper

Read More »

31

NETWORKS
2008

118views Computer Networks» more NETWORKS 2008»

On a graph coloring problem arising from discrete tomography

14 years 24 days ago

On a graph coloring problem arising from discrete tomography

Download www.lri.fr

Cédric Bentz, Marie-Christine Costa, Domini...

claim paper

Read More »