A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mahabadi, Sepideh, Roghani, Mohammad, Tarnawski, Jakub
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2506.01669