3958 search results - page 196 / 792 » Dynamic Graph Algorithms with Applications |
179
click to vote
TPDS
2008
15 years 6 months ago
2008
Abstract-- With increasing richness in features such as personalization of content, web applications are becoming more complex and hence compute intensive. Traditional approaches t...
142
click to vote
FOCM
2006
15 years 6 months ago
2006
We introduce some modifications and extensions of the concept od index pair in the Conley index theory. We then show how these concepts may be used to overcome some difficulties in...
184
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
170
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
165
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...