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

An optimal algorithm for geometrical congruence

โœ Scribed by M.D Atkinson


Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
768 KB
Volume
8
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An Optimal Parallel Matching Algorithm f
โœ R. Lin; S. Olariu ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 865 KB

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an \(n\)-v