A Randomized Parallel Algorithm for Planar Graph Isomorphism

We present a parallel randomized algorithm running on aCRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph (which can be computed by known algorithms inO(log2n) time withn1+ϵprocessors,...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of algorithms Jg. 28; H. 2; S. 290 - 314
Hauptverfasser:	Gazit, Hillel, Reif, John H
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	San Diego, CA Elsevier Inc 01.08.1998 Elsevier
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences BFS trees Computer science; control theory; systems Exact sciences and technology Graph isomorphism Information retrieval. Graph Parallel processing Planar graphs Theoretical computing Parallel processing BFS trees Graph isomorphism Planar graphs Randomised algorithms Isomorphic graph Graph theory Parallel algorithms Planar graph
ISSN:	0196-6774, 1090-2678
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!