Optimal Parallel Algorithms forStraight-Line Grid Embeddings of Planar Graphs

Authors:
Ming-Yang Kao;Martin Fürer;Xin He;Balaji Raghavachari
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
1994

Citing 0
Cited 1

O(nlog log n)-work parallel algorithms for straight-line grid embeddings of planar graphs

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

The cocycle code of an undirected graph $\Gamma$ is the linear span over F2 of the characteristic vectors of cutsets. (If $\Gamma$ is complete bipartite, this is the generalized Gale-Berlekamp code.) The natural bijection between the ...