๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An optimal parallelization of the two-list algorithm of cost

โœ Scribed by Fouad B. Chedid

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
96 KB
Volume
34
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An optimal parallel algorithm for node r
An optimal parallel algorithm for node ranking of cographs
โœ Liu Chuan-Ming; Yu Ming-Shing ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 885 KB

A ranking of a graph G is a mapping, p, from the vertices of G to the natural numbers such that for every path between any two vertices u and u, uf II, with p(u) = p(u), there exists at least one vertex w on that path with p(w) > p(u) = p(u). The value p(u) of a vertex u is the rank of vertex II. A

An Optimal Simple Parallel Algorithm for
An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs
โœ Shan-Chyun Ku; Biing-Feng Wang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 91 KB

An outerplanar graph is a planar graph that can be imbedded in the plane in such a way that all vertices lie on the exterior face. An outerplanar graph is maximal if no edge can be added to the graph without violating the outerplanarity. In this paper, an optimal parallel algorithm is proposed on th