Searching for "On the k-Coloring of Intervals." – sorted by Relevance.
-
On Intervalizing k-Colored Graphs for DNA Physical Mapping
- On Intervalizing k-Colored Graphs for DNA Physical Mapping Hans L. Bodlaender x Babette de
- Cited by 4 (2 self) – Add To MetaCart
-
Precoloring Extension on Unit Interval Graphs
- ,1 . . . . . . . . . . . . I0,0 I0,0 I0,1 I0,1 I0,2 I0,2 I1,0 I1,0 Figure 1: (a) In every k-coloring c of the (open) intervals
- Cited by 3 (2 self) – Add To MetaCart
-
Splitting
- are forbidden. Goldberg and West [13] proved that every k-colored interval has a splitting of size at most k
- Add To MetaCart
-
Connected Component and Simple Polygon Intersection Searching
- , and hence, the overall query time to report k colors of intervals intersecting a query point x is O((k+ 1
- Cited by 9 (2 self) – Add To MetaCart
-
Provably Good Moat Routing
- that the channel is horizontal). A K-coloring of this interval graph corresponds directly to a channel routing
- Cited by 1 (1 self) – Add To MetaCart
-
Scheduling space-ground communications for the Air Force satellite control network
- on the equivalence of the interval scheduling problem to the k-colorability of an interval graph [14]. We present a 8
- Cited by 9 (5 self) – Add To MetaCart

