Time-Optimal Sublinear Algorithms for Matching and Vertex Cover

We study the problem of estimating the size of maximum matching and minimum vertex cover in sub linear time. Denoting the number of vertices by n and the average degree in the graph by \overline{d} , we obtain the following results for both problems which are all provably time-optimal up to polyloga...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 873 - 884
Main Author:	Behnezhad, Soheil
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.02.2022
Subjects:	Complexity theory Computer science Indium tin oxide maximum matching minimum vertex cover Sublinear time algorithms
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!