By Topic

Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Gazit, Hillel ; Dept. of Comput. Sci., Duke Univ., Durham, NC, USA

Parallel EREW deterministic algorithms for finding the connected components, ear decomposition and st-numbering of a planar graph are presented. The algorithms take O(log(n)) time with log(n)/n+m processors. Previous results have the same complexity, but use the CRCW model. The same algorithms can be used for graphs with low genus. Let g be the genus of the minimal embedding of the graph, n the number of vertices and m the number of edges. The new algorithm takes T=O(log( n)+log2(g)) time and using optimal space and P=O(log(n)/n+m) processors

Published in:

Parallel Processing Symposium, 1991. Proceedings., Fifth International

Date of Conference:

30 Apr-2 May 1991