✦ LIBER ✦

Finding a maximum matching in a sparse random graph in O ( n ) expected time

✍ Scribed by Chebolu, Prasad; Frieze, Alan; Melsted, P'all

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding a Maximum Independent Set in a S

✍ Feige, Uriel; Ofek, Eran 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 333 KB

Finding a maximum matching in a permutat

✍ Chongkye Rhee, Y. Daniel Liang 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 723 KB

Finding a maximum matching in a circular

✍ Y.Daniel Liang; Chongkye Rhee 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Computing a maximum cardinality matching

✍ H. Alt; N. Blum; K. Mehlhorn; M. Paul 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 503 KB

Maximum matchings in a class of random g

✍ A.M. Frieze 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 630 KB

Finding a maximum induced matching in we

✍ Kathie Cameron; R. Sritharan; Yingwen Tang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 117 KB