Algorithms and data structures developed to solve graph problems on parallel computers
are surveyed. The problems discussed relate to searching graphs and finding connected …

Much of the progress in the fields constituting cognitive science has been based upon the
use of explicit information processing models, almost exclusively patterned after …

The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel
with a feasible (polynomial) number of processors. Many natural problems in NC are known; …

This paper concerns the computational complexity of depth-first search. Suppose we are
given a rooted graph G with fixed adjacency lists and vertices u, v. We wish to test if u is first …

We show that every 2-connected triangulated planar graph with n vertices has a simple
cycle C of length at most 4@@@@ n which separates the interior vertices A from the exterior …

Trees play a fundamental role in many computations, both for sequential as well as parallel
problems. The classic paradigm applied to generate parallel algorithms in the presence of …

Designing efficient algorithms for parallel computers | Guide books skip to main content
ACM Digital Library home ACM Association for Computing Machinery corporate logo …

The linear time serial algorithm of Lempel et al.(1967) for testing planarity of graphs uses the
linear time serial algorithm of Even and Tarjan (1976) for st-numbering. This st-numbering …

A projection of a Boolean function is a function obtained by substituting for each of its
variables a variable, the negation of a variable, or a constant. Reducibilities among …

We present a new algorithm for finding the tri-connected components of an undirected
graph. The algorithm is based on ear decomposition and has linear sequential running time …