Parallel symmetry-breaking in sparse graphs

Authors:
A. Goldberg;S. Plotkin;G. Shannon
Affiliations:
Lab. for Computer Scince, M.I.T., Cambridge, MA;Lab. for Computer Scince, M.I.T., Cambridge, MA;Computer Scinces Dept., Purdue University, West Lafayette, IN
Venue:
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Year:
1987

Citing 15
Cited 33

Routing, merging, and sorting on parallel models of computation

Journal of Computer and System Sciences
Complexity of network synchronization

Journal of the ACM (JACM)
An improved parallel algorithm for maximal matching

Information Processing Letters
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Parallel algorithms for depth-first searches I. planar graphs

SIAM Journal on Computing
A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
A simple parallel algorithm for the maximal independent set problem

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Optimal bounds for decision problems on the CRCW PRAM

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel (&Dgr;+1)-coloring of constant-degree graphs

Information Processing Letters
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallelism in random access machines

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Finding euler circuits in logarithmic parallel time

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A fast parallel algorithm for the maximal independent set problem

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Two linear-time algorithms for five-coloring a planar graph

Two linear-time algorithms for five-coloring a planar graph
Lower bounds in parallel machine computation

Lower bounds in parallel machine computation

One bit algorithms

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The power of multimedia: combining point-to point and multi-access networks

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
An optimal linked list prefix algorithms on a local memory computer

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Lower bounds for parallel computation on linked structures

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for gray-scale image component labeling on a mesh-connected computer

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A contraction procedure for planar directed graphs

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Locality based graph coloring

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Greed is good: approximating independent sets in sparse and bounded-degree graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fault-local distributed mending (extended abstract)

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Fast distributed construction of k-dominating sets and applications

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Disentangling multi-object operations (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Fast distributed graph coloring with O(&Dgr;) colors

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The string edit distance matching problem with moves

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube

IEEE Transactions on Parallel and Distributed Systems
Distributed coloring and communication in rings with local knowledge

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Distributed Soft Path Coloring

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Distributed Colouring and Communication in Rings with Local Knowledge

Combinatorics, Probability and Computing
A distributed algorithm to find k-dominating sets

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Coloring unstructured radio networks

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Efficient interference-aware TDMA link scheduling for static wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
The string edit distance matching problem with moves

ACM Transactions on Algorithms (TALG)
Sparse parallel Delaunay mesh refinement

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Local management of a global resource in a communication network

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A new parallel algorithm for the maximal independent set problem

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm

Theoretical Computer Science
Algorithms for sensor and ad hoc networks: advanced lectures

Algorithms for sensor and ad hoc networks: advanced lectures
Distributed coloring in Õ (√log n) Bit Rounds

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
MIS on trees

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deterministic Distributed Vertex Coloring in Polylogarithmic Time

Journal of the ACM (JACM)
Efficient distributed weighted matchings on trees

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Greedy sequential maximal independent set and matching are parallel on average

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
On the locality of some NP-complete problems

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Distributed computing with advice: information sensitivity of graph coloring

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe efficient deterministic techniques for breaking symmetry in parallel. The techniques work well on rooted trees and graphs of constant degree or genus. Our primary technique allows us to 3-color a rooted tree in &Ogr;(lg*n) time on an EREW PRAM using a linear number of processors. We apply these techniques to construct fast linear processor algorithms for several problems, including (&Dgr; + 1)-coloring constant-degree graphs, 5-coloring planar graphs, and finding depth-first-search trees in planar graphs. We also prove lower bounds for 2-coloring directed lists and for finding maximal independent sets in arbitrary graphs.