On a graph coloring problem arising from discrete tomography

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Networks

• Publication date

  2008-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1002/net.20218
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Using graphs for some discrete tomography problems

  2006cited by this paper
• A solvable case of image reconstruction in discrete tomography

  2005cited by this paper
• NP‐completeness of list coloring and precoloring extension on the edges of planar graphs

  2005cited by this paper
• Discrete tomography : foundations, algorithms, and applications

  1999cited by this paper
• Nesticity, DIMACS series

  1997cited by this paper
• Open shop scheduling with some additional constraints

  1996cited by this paper
• Precoloring Extension with Fixed Color Bound

  1994cited by this paper
• Scheduling with Incompatible Jobs

  1992cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982influential reference
• The NP-Completeness of Edge-Coloring

  1981cited by this paper
• A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas

  1979cited by this paper
• Combinatorial Properties of Matrices of Zeros and Ones

  1957cited by this paper

• Histogram tomography

  2018cites this paper
• Notes on Histotomography

  2018cites this paper
• Exact and approximation algorithms for some packing and covering problems in graphs

  2017cites this paper
• An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem

  2017cites this paper
• An improved DSATUR-based Branch and Bound for the Vertex Coloring Problem

  2015cites this paper
• Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable

  2012cites this paper
• On the Approximability of the Maximum Interval Constrained Coloring Problem

  2010cites this paper
• Graph coloring with cardinality constraints on the neighborhoods

  2009cites this paper
• On the use of graphs in discrete tomography

  2008cites this paper
• Reconstruction de la coloration dun graphe à partir des projections des voisinages

  2007cites this paper