84 search results - page 2 / 17 » A Parallel Distance-2 Graph Coloring Algorithm for Distribut... |
PPOPP
2009
ACM
14 years 5 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
ICDCN
2011
Springer
12 years 8 months ago
2011
Springer
Distributed processing of real-world graphs is challenging due to their size and the inherent irregular structure of graph computations. We present HIPG, a distributed framework th...
SPAA
2009
ACM
13 years 11 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
JPDC
2008
13 years 4 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...