@article {15011,
	title = {Parallel algorithms for planar graph isomorphism and related problems},
	journal = {Circuits and Systems, IEEE Transactions on},
	volume = {35},
	year = {1988},
	month = {1988/03//},
	pages = {304 - 311},
	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 <e1>O</e1>( radic;<e1>n</e1>)-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 = {2D, algorithms;, algorithms;parallel, array;computational, array;CREW-PRAM, coarsest, complexity;graph, components;two-dimensional, COMPUTATION, graph, graph;planar, isomorphism;single-function, model;mesh, models;planar, partitioning, problem;triconnected, processor, theory;parallel},
	isbn = {0098-4094},
	doi = {10.1109/31.1743},
	author = {JaJa, Joseph F. and Kosaraju,S.R.}
}
