DocumentCode :
2892886
Title :
A deterministic parallel algorithm for planar graphs isomorphism
Author :
Gazit, Hillel
fYear :
1991
fDate :
1-4 Oct 1991
Firstpage :
723
Lastpage :
732
Abstract :
A deterministic parallel algorithm for determining whether two planar graphs are isomorphic is presented. The algorithm needs O(log n) separators that have to be computed one after the other. The running time is T=O(log3 n) time for finding separators, and the processors count is n1.5 log n/T. It is also shown that every planar graph has a separator, and a parallel algorithm for finding the separator is given
Keywords :
Arithmetic; Computational modeling; Concurrent computing; Contracts; Parallel algorithms; Particle separators; Phase change random access memory; Read-write memory; Tree graphs; Vegetation mapping;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location :
San Juan
Print_ISBN :
0-8186-2445-0
Type :
conf
DOI :
10.1109/SFCS.1991.185440
Filename :
185440
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2892886
بازگشت