Title :
Parallel algorithms for planar graph isomorphism and related problems
Author :
JáJá, Joseph ; Kosaraju, S. Rao
Author_Institution :
Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA
fDate :
3/1/1988 12:00:00 AM
Abstract :
Parallel algorithms for planar graph isomorphism and several related problems are presented. Two models of parallel computation are considered: the CREW-PRAM model and the two-dimensional array of processors. The results include O(√n)-time mesh algorithms for finding a good separating cycle and the triconnected components of a planar graph, and for solving the single-function coarsest partitioning problem
Keywords :
computational complexity; graph theory; parallel algorithms; 2D processor array; CREW-PRAM model; mesh algorithms; parallel algorithms; parallel computation models; planar graph; planar graph isomorphism; single-function coarsest partitioning problem; triconnected components; two-dimensional array; Automata; Computational modeling; Concurrent computing; Context modeling; Graph theory; Parallel algorithms; Partitioning algorithms; Phase change random access memory; Testing; Tree graphs;
Journal_Title :
Circuits and Systems, IEEE Transactions on
