Brief announcement: efficient graph algorithms without synchronization

Johannes Schneider, Roger Wattenhofer

Abstract: We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchronization on a distributed memory system. For coloring, evaluation shows a performance gain of a factor 3 to 5 at the price of using more colors.