3008 search results - page 286 / 602 » Independence in connected graphs |
253
click to vote
CRV
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...
188
click to vote
FSTTCS
2007
Springer
16 years 26 days ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
212
click to vote
FOSSACS
2006
Springer
15 years 10 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
198
click to vote
TCOS
2010
15 years 5 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...