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,...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of algorithms Ročník 28; číslo 2; s. 290 - 314
Hlavní autori:	Gazit, Hillel, Reif, John H
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Diego, CA Elsevier Inc 01.08.1998 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!