A linear-processor algorithm for depth-first search in planar graphs

A linear-processor algorithm for depth-first search in planar graphs

We present an n-processor and O(log 2 n) time parallel RAM algorithm for finding a depth-first-search tree in an n-vertex planar graph. The algorithm is based on a new n-processor algorithm for finding a cyclic separator in a planar graph and Smith's (1986) original parallel depth-first-search...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1988-10, Vol.29 (3), p.119-123
1. Verfasser: Shannon, Gregory E.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Analysis of algorithms
Combinatorics
Combinatorics. Ordered structures
cyclic separator
depth-first search
Exact sciences and technology
Graph theory
Graphs
Information processing
Linear programming
Mathematics
parallel algorithm
planar graph
Sciences and techniques of general use
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present an n-processor and O(log 2 n) time parallel RAM algorithm for finding a depth-first-search tree in an n-vertex planar graph. The algorithm is based on a new n-processor algorithm for finding a cyclic separator in a planar graph and Smith's (1986) original parallel depth-first-search algorithm for planar graphs.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(88)90048-8