92 search results - page 15 / 19 » Scalable parallel graph coloring algorithms |
HIPC
2005
Springer
14 years 1 months ago
2005
Springer
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
ICDCS
2002
IEEE
14 years 28 days ago
2002
IEEE
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
ICDCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider distributed applications that continuously stream data across the network, where data needs to be aggregated and processed to produce a 'useful' stream of up...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
VLSISP
2002
13 years 7 months ago
2002
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...