ICALP 2025 talk: A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time



This content originally appeared on Jakub Tarnawski and was authored by Jakub Tarnawski


This content originally appeared on Jakub Tarnawski and was authored by Jakub Tarnawski


Print Share Comment Cite Upload Translate Updates
APA

Jakub Tarnawski | Sciencx (2025-07-10T19:59:40+00:00) ICALP 2025 talk: A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time. Retrieved from https://www.scien.cx/2025/07/10/icalp-2025-talk-a-0-51-approximation-of-maximum-matching-in-sublinear-n1-5-time/

MLA
" » ICALP 2025 talk: A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time." Jakub Tarnawski | Sciencx - Thursday July 10, 2025, https://www.scien.cx/2025/07/10/icalp-2025-talk-a-0-51-approximation-of-maximum-matching-in-sublinear-n1-5-time/
HARVARD
Jakub Tarnawski | Sciencx Thursday July 10, 2025 » ICALP 2025 talk: A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time., viewed ,<https://www.scien.cx/2025/07/10/icalp-2025-talk-a-0-51-approximation-of-maximum-matching-in-sublinear-n1-5-time/>
VANCOUVER
Jakub Tarnawski | Sciencx - » ICALP 2025 talk: A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time. [Internet]. [Accessed ]. Available from: https://www.scien.cx/2025/07/10/icalp-2025-talk-a-0-51-approximation-of-maximum-matching-in-sublinear-n1-5-time/
CHICAGO
" » ICALP 2025 talk: A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time." Jakub Tarnawski | Sciencx - Accessed . https://www.scien.cx/2025/07/10/icalp-2025-talk-a-0-51-approximation-of-maximum-matching-in-sublinear-n1-5-time/
IEEE
" » ICALP 2025 talk: A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time." Jakub Tarnawski | Sciencx [Online]. Available: https://www.scien.cx/2025/07/10/icalp-2025-talk-a-0-51-approximation-of-maximum-matching-in-sublinear-n1-5-time/. [Accessed: ]
rf:citation
» ICALP 2025 talk: A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time | Jakub Tarnawski | Sciencx | https://www.scien.cx/2025/07/10/icalp-2025-talk-a-0-51-approximation-of-maximum-matching-in-sublinear-n1-5-time/ |

Please log in to upload a file.



There are no updates yet.
Click the Upload button above to add an update.

You must be logged in to translate posts. Please log in or register.

Related Posts