718 search results - page 105 / 144 » Coloring quasi-line graphs |
122
click to vote
PLDI
2004
ACM
15 years 7 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...
100
click to vote
SODA
2004
ACM
15 years 3 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...
111
click to vote
SIROCCO
2010
15 years 3 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
109
click to vote
DM
2007
15 years 1 months ago
2007
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
114
click to vote
SOFSEM
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...