Sciweavers

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

18

ICALP
1995
Springer

favoriteEmaildiscussreport

118views Programming Languages» more ICALP 1995»

Intervalizing k-Colored Graphs

13 years 8 months ago

Intervalizing k-Colored Graphs

Download igitur-archive.library.uu.nl

The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the problem for the case that the number of colors k is xed. For k = 2, we give a simple linear time algorithm, for k = 3, we give an On2 algorithm for biconnected graphs with n vertices, and for k = 4, we show that the problem is NP-complete.

Hans L. Bodlaender, Babette de Fluiter

Real-time Traffic

DNA Physical Mapping | ICALP 1995 | Interval Graph | Linear Time Algorithm | Programming Languages |

claim paper

Related Content

» On the kColoring of Intervals

» The harmonious coloring problem is NPcomplete for interval and permutation graphs

» Why Almost All kColorable Graphs Are Easy to Color

» Deciding kColorability of P5Free Graphs in Polynomial Time

» Coloring Sparse Random kColorable Graphs in Polynomial Expected Time

» Improved Inapproximability Results for Maximum kColorable Subgraph

» The Roberts characterization of proper and unit interval graphs

» Clique Clustering Yields a PTAS for maxColoring Interval Graphs

» Recognizing dInterval Graphs and dTrack Interval Graphs

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	ICALP
Authors	Hans L. Bodlaender, Babette de Fluiter

Comments (0)