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

An Algebraic Matching Algorithm

โœ Scribed by James F. Geelen


Publisher
Springer-Verlag
Year
2000
Tongue
English
Weight
196 KB
Volume
20
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An approximate string-matching algorithm
โœ Jong Yong Kim; John Shawe-Taylor ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 774 KB
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