3958 search results - page 50 / 792 » Dynamic Graph Algorithms with Applications |
129
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
126
Voted
PVLDB
2008
15 years 2 months ago
2008
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
108
Voted
ESA
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
134
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
148
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...