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

Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems

โœ Scribed by M. G. Andrews; M. J. Atallah; D. Z. Chen; D. T. Lee

Publisher
Springer
Year
2000
Tongue
English
Weight
192 KB
Volume
26
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Efficient Parallel Algorithm for Maxi
An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs
โœ I. Parfenoff ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 403 KB

The P 4 -tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with few induced P 4 (cographs, P 4 -sparse graphs, P 4 -lite graphs). Here, we propose an extension of R. Lin and S. Olariu's work (1994. J. Parallel Distributed Computing 22, 26 36.) on cographs, usi