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

b -Matchings in Trees

โœ Scribed by Goodman, S.; Hedetniemi, S.; Tarjan, R. E.

Book ID
118168585
Publisher
Society for Industrial and Applied Mathematics
Year
1976
Tongue
English
Weight
454 KB
Volume
5
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Matchings in starlike trees
Matchings in starlike trees
โœ I. Gutman; O. Araujo; J. Rada ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB

## Let m(G,k) be the number of k-matchings in the graph G. We write G1 -~ G2 if m(Gl,k) <\_ m(G2,k) for all k = 1,2,.... A tree is said to be starlike if it possesses exactly one vertex of degree greater than two. The relation T1 -~ T2 is shown to hold for various pairs of starlike trees T1,T2. T

Maximum matchings and trees
Maximum matchings and trees
โœ Carla Savage ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 537 KB
Parallel computation of matchings in tre
Parallel computation of matchings in trees
โœ Constantine N.K. Osiakwan; Selim G. Akl ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 932 KB

We present adaptive parallel algorithms for b-matchings in trees. The algorithms are designed using the exclusive-read exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a tree of n vertices, we present an algorithm that determines a maximum cardinality b-m