765 search results - page 111 / 153 » Graph Coloring with Rejection |
INFOVIS
2005
IEEE
14 years 2 months ago
2005
IEEE
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
CIVR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper, we present a framework for segmenting the news programs into different story topics. The proposed method utilizes both visual and text information of the v...
DM
2008
13 years 8 months ago
2008
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
PLDI
2004
ACM
14 years 2 months ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...