Some problems related to the Karp-Sipser algorithm on random graphs
<p>We study certain questions related to the performance of the Karp-Sipser algorithm on the sparse Erdős-Rényi random graph.</p> <p>The Karp-Sipser algorithm, introduced by Karp and Sipser [34] is a greedy algorithm which aims to obtain a near-maximum matching on a given graph....
| मुख्य लेखक: | |
|---|---|
| अन्य लेखक: | |
| स्वरूप: | थीसिस |
| प्रकाशित: |
2017
|
| विषय: |