✦ 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
DOI: 10.1007/s004930070031

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 Effective Algorithm For Fingerprint M

An Effective Algorithm For Fingerprint Matching

✍ Ying, Hao 📂 Fiction 📅 0 🌐 Spanish ⚖ 461 KB

An algorithm for algebraic assignment pr

An algorithm for algebraic assignment problems

✍ A.M. Frieze 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 730 KB

An algebraic hardware/software partition

An algebraic hardware/software partitioning algorithm

✍ Shengchao Qin; Jifeng He; Zongyan Qiu; Naixiao Zhang 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 688 KB

An Optimal Parallel Matching Algorithm f

An Optimal Parallel Matching Algorithm for Cographs

✍ 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

An efficient heuristic algorithm for min

An efficient heuristic algorithm for minimum matching

✍ P. Grassberger; H. Freund 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 653 KB