Abstract.
The problems of Interval Sandwich (IS) and Intervalizing Colored Graphs (ICG) have received a lot of attention recently, due to their applicability to DNA physical mapping problems with ambiguous data. Most of the results obtained so far on the problems were hardness results. Here we study the problems under assumptions of sparseness, which hold in the biological context. We prove that both problems are polynomial when either (1) the input graph degree and the solution graph clique size are bounded, or (2) the solution graph degree is bounded. In particular, this implies that ICG is polynomial on bounded degree graphs for every fixed number of colors, in contrast with the recent result of Bodlaender and de Fluiter.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received October 2, 1997; revised April 1, 1998.
Rights and permissions
About this article
Cite this article
Kaplan, H., Shamir, R. Bounded Degree Interval Sandwich Problems . Algorithmica 24, 96–104 (1999). https://doi.org/10.1007/PL00009277
Issue Date:
DOI: https://doi.org/10.1007/PL00009277