268 search results - page 7 / 54 » Cleaning Interval Graphs |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
DAM
2007
14 years 10 months ago
2007
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
85
Voted
ALGORITHMICA
2007
14 years 10 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
92
Voted
ESA
2005
Springer
15 years 3 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
110
Voted
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...