✦ LIBER ✦

Quantum Algorithms for Matching Problems

✍ Scribed by Sebastian Dörn

Publisher: Springer
Year: 2008
Tongue: English
Weight: 347 KB
Volume: 45
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-008-9118-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast primal-dual distributed algorithms

Fast primal-dual distributed algorithms for scheduling and matching problems

✍ Alessandro Panconesi; Mauro Sozio 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 365 KB

An efficient algorithm for some tree mat

An efficient algorithm for some tree matching problems

✍ Fabrizio Luccio; Linda Pagli 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 788 KB

Quantum information algorithms – new sol

Quantum information algorithms – new solutions for known problems

✍ M. Nölle; B. Ömer; M. Suda 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 248 KB

A simple approximation algorithm for the

A simple approximation algorithm for the weighted matching problem

✍ Doratha E Drake; Stefan Hougardy 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 61 KB

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [

Efficient labelling algorithms for the m

Efficient labelling algorithms for the maximum noncrossing matching problem

✍ Federico Malucelli; Thomas Ottmann; Daniele Pretolani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 336 KB

Efficient Algorithms for Petersen's Matc

Efficient Algorithms for Petersen's Matching Theorem

✍ Therese C. Biedl; Prosenjit Bose; Erik D. Demaine; Anna Lubiw 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Petersen's theorem is a classic result in matching theory from 1891, stating that every 3-regular bridgeless graph has a perfect matching. Our work explores efficient algorithms for finding perfect matchings in such graphs. Previously, the only relevant matching algorithms were for general graphs, a