Finding Euler tours in parallel
Journal of Computer and System Sciences
A linear algorithm for embedding planar graphs using PQ-trees
Journal of Computer and System Sciences
Efficient parallel algorithms for edge coloring problems
Journal of Algorithms
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
A simple parallel tree contraction algorithm
Journal of Algorithms
Matching partition a linked list and its optimization
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Fast algorithms for edge-coloring planar graphs
Journal of Algorithms
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
An introduction to parallel algorithms
An introduction to parallel algorithms
A constructive proof of Vizing's Theorem
Information Processing Letters
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Fast parallel algorithms for the approximate edge-coloring problem
Information Processing Letters
Parallel algorithms for the edge-coloring and edge-coloring update problems
Journal of Parallel and Distributed Computing
Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
| Hi-index | 0.00 |
The following EREW PRAM algorithms for edge-colouring a general graph are presented: 1. an algorithm that finds a (Δ + d)-edge-colouring, 1 ≤ d O((log d + (Δ/d)4)log2 n) time, using n + m processors; 2. an algorithm that finds a Δ1+ε-edge-colouring, 0 O(log Δ log* n) time, using nΔ1+ε processors.