A graph-planarization algorithm and its application to random graphs

Authors:
Takao Ozawa;H. Takahashi
Affiliations:
-;-
Venue:
Proceedings of the 17th Symposium of Research Institute of Electric Communication on Graph Theory and Algorithms
Year:
1980

Optimal parallel algorithms for transitive closure and point location in planar structures

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Alpha-algorithms for incremental planarity testing (preliminary version)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An analysis of some heuristics for the maximum planar subgraph problem

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Hi-index	0.00