On a graph coloring problem arising from discrete tomography
From MaRDI portal
Publication:3515882
DOI10.1002/net.20218zbMath1203.68304OpenAlexW4231211187MaRDI QIDQ3515882
Dominique de Werra, Marie-Christine Costa, Bernard Ries, Cédric Bentz, Christophe Picouleau
Publication date: 29 July 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/326909/files/paths-rero.pdf
Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
On the approximability of the maximum interval constrained coloring problem ⋮ Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ On the use of graphs in discrete tomography ⋮ On the use of graphs in discrete tomography ⋮ Graph coloring with cardinality constraints on the neighborhoods ⋮ Histogram tomography
Cites Work
This page was built for publication: On a graph coloring problem arising from discrete tomography
