1206 search results - page 108 / 242 » Arc-Flags in Dynamic Graphs |
126
click to vote
VALUETOOLS
2006
ACM
15 years 6 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
125
Voted
UM
2005
Springer
15 years 6 months ago
2005
Springer
We develop a novel user-centric modeling technology, which can dynamically describe and update a person's expertise profile. In an enterprise environment, the technology can e...
109
click to vote
ESA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
102
click to vote
ICNP
2000
IEEE
15 years 5 months ago
2000
IEEE
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...