Parallel Symmetry-Breaking in Sparse Graphs

Abstract
This document describes efficient deterministic techniques for breaking symmetry in parallel. These techniques work well on rooted trees and graphs of constant degree or genus. The authors' primary technique allows us to 3-color a rooted tree in 0(1g*n) time on an EREW PRAM using a linear number of processors. They use these techniques to construct fast linear processor algorithms for several problems, including the problem of (delta + 1)-coloring constant-degree graphs and 5-coloring planar graphs. They also prove lower bounds for 2-coloring directed lists and for finding maximal independent sets in arbitrary graphs.

This publication has 0 references indexed in Scilit: