3958 search results - page 339 / 792 » Dynamic Graph Algorithms with Applications |
180
click to vote
CIKM
2005
Springer
16 years 8 days ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
201
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
168
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. Howeve...
166
click to vote
EMSOFT
2005
Springer
16 years 8 days ago
2005
Springer
Abstract— This paper explores the problem of efficiently ordering interprocessor communication operations in both statically and dynamically-scheduled multiprocessors for iterat...
173
Voted
HPDC
2007
IEEE
15 years 10 months ago
2007
IEEE
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...