230 search results - page 34 / 46 » Time Varying Undirected Graphs |
143
click to vote
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
123
click to vote
PRL
2007
15 years 2 months ago
2007
In this paper, we tackle the problem of matching of objects in video in the context of the rough indexing paradigm. The approach developed is based on matching of region adjacency...
115
click to vote
UIST
2009
ACM
15 years 10 months ago
2009
ACM
Time-series graphs are often used to visualize phenomena that change over time. Common tasks include comparing values at different points in time and searching for specified patte...
123
click to vote
SODA
2010
ACM
16 years 24 days ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
138
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...