15 search results - page 1 / 3 » Approximating Interval Coloring and Max-Coloring in Chordal ... |
WEA
2004
Springer
13 years 10 months ago
2004
Springer
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...
DAM
2011
12 years 12 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
IPL
2010
13 years 3 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...