𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing dominators on a cube-connected machine

✍ Scribed by S.J Horng

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
718 KB
Volume
19
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sharp upper bound on algebraic connect
A sharp upper bound on algebraic connectivity using domination number
✍ M. Aouchiche; P. Hansen; D. StevanoviΔ‡ πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 760 KB

Let G be a connected graph of order n. The algebraic connectivity of G is the second smallest eigenvalue of the Laplacian matrix of G. A dominating set in G is a vertex subset S such that each vertex of G that is not in S is adjacent to a vertex in S. The least cardinality of a dominating set is the

Parallel strong orientation on a mesh co
Parallel strong orientation on a mesh connected computer
✍ Manfred Schimmler πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 411 KB

Schimmler, M., Parallel strong orientation on a mesh connected computer, Parallel Computing 17 (1991) 657-664. We present a solution for the following problem: given an undirected bridgeless connected graph G = (V, E), find an orientation of each edge such that the resulting directed graph is stron