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

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

Sepideh Mahabadi Mohammad Roghani Jakub Tarnawski

来源：

Arxiv

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

Sepideh Mahabadi Mohammad Roghani Jakub Tarnawski

作者信息

引用本文复制引用

Sepideh Mahabadi,Mohammad Roghani,Jakub Tarnawski.A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time[EB/OL].(2025-06-02)[2025-12-13].https://arxiv.org/abs/2506.01669.

学科分类

计算技术、计算机技术

首发时间： 2025-06-02

下载量：0

点击量：2

段落导航

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

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

引用本文复制引用

学科分类

评论