Communications of the ACM - Special issue on parallelism
Coloring planar graphs in parallel
Journal of Algorithms
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
Optimal parallel algorithms on planar graphs
VLSI Algorithms and Architectures
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
The graph genus problem is NP-complete
Journal of Algorithms
Efficient parallel algorithms for some graph problems
Communications of the ACM
Computing connected components on parallel computers
Communications of the ACM
Robot Vision
Parallel algorithms for connected components in a graph
FCT '85 Fundamentals of Computation Theory
On determining the genus of a graph in O(v O(g)) steps(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The Complexity of Parallel Computations
The Complexity of Parallel Computations
A contraction procedure for planar directed graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A comparison of parallel algorithms for connected components
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |