scientific article
From MaRDI portal
Publication:3798260
zbMath0652.68080MaRDI QIDQ3798260
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Improved parallel depth-first search in undirected planar graphs, An optimal parallel algorithm for planar cycle separators, A model classifying algorithms as inherently sequential with applications to graph searching, Not all planar digraphs have small cycle separators, Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs