Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms

v1

Type:Journal Article

0 views

[![NobleID](https://www.nobleid.org/api/badge/DCE05DF3.svg?ark=w1%2F20260515%2FDCE05DF3)](https://nobleid.org/work/w1/20260515/DCE05DF3)

ARK Inflections

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors