Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
A las vegas rnc algorithm for maximum matching. |
| Συγγραφείς: |
Karloff, Howard |
| Πηγή: |
Combinatorica; Dec1986, Vol. 6 Issue 4, p387-391, 5p |
| Περίληψη: |
Recently two randomized algorithms were discovered that find a maximum matching in an arbitrary graph in polylog time, when run on a parallel random access machine. Both are Monte Carlo algorithms - they have the drawback that with non-zero probability the output is a non-maximum matching. We use the min-max formula for the size of a maximum matching to convert any Monte Carlo maximum matching algorithm into a Las Vegas (error-free) one. The resulting algorithm returns (with high probability) a maximum matching and a certificate proving that the matching is indeed maximum. [ABSTRACT FROM AUTHOR] |
|
Copyright of Combinatorica is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Complementary Index |