3958 search results - page 135 / 792 » Dynamic Graph Algorithms with Applications |
204
click to vote
SIGSOFT
1994
ACM
15 years 10 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
197
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
170
click to vote
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
147
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
182
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...