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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1988
Accession Number
ADA198233

Entities

People

  • Andrew V. Goldberg
  • Gregory E. Shannon
  • Serge A. Plotkin

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Autonomy
  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Contracts
  • Graph Theory
  • Identification
  • Information Processing
  • Information Systems
  • Iterations
  • Language
  • Notation
  • Parallel Computing
  • Parallel Processing
  • Security

Readers

  • Graph Algorithms and Convex Optimization.