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

Parallel Computations in Graph Theory

โœ Scribed by Reghbati (Arjomandi), Eshrat; Corneil, D. G.

Book ID
118157568
Publisher
Society for Industrial and Applied Mathematics
Year
1978
Tongue
English
Weight
992 KB
Volume
7
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

FAST COMPUTATIONS IN VOLTAGE GRAPH THEOR
FAST COMPUTATIONS IN VOLTAGE GRAPH THEORY
โœ Jonathan L. Gross; Thomas W. Tucker ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 365 KB
Parallel concepts in graph theory
Parallel concepts in graph theory
โœ F. Harary ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 376 KB

edge of a graph G is taken as a basic unit, regarded as the set of its two nodes. Two edges are called parallel (or independent) if they are disjoint. Then a l-factor (or perfect matching) of G is a spanning set of parallel edges. A l-factorization of G is a partition of its edge set E(G) into l-fac

Parallel computations on graphs
Parallel computations on graphs
โœ E. A. Ivanov; V. P. Shevchenko ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Springer US ๐ŸŒ English โš– 748 KB