Optimal parallel coloring algorithms for a family of tree-representable graphs

Authors:
R. Lin;S. Olariu
Affiliations:
Department of Computer Science, SUNY at Geneseo, Geneseo, NY;Department of Computer Science, Old Dominion University, Norfolk, VA
Venue:
CSC '91 Proceedings of the 19th annual conference on Computer Science
Year:
1991

Citing 8
Cited 0

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
An optimal parallel algorithm for dynamic expression evaluation and its applications

Proc. of the sixth conference on Foundations of software technology and theoretical computer science
Parallel processing for efficient subdivision search

SCG '87 Proceedings of the third annual symposium on Computational geometry
Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time

SIAM Journal on Computing
Binary tree algebraic computation and parallel algorithms for simple graphs

Journal of Algorithms
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
A simple parallel tree contraction algorithm

Journal of Algorithms
A tree representation for P4-sparse graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract