Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model

The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer science. Despite a significant body of work dedicated to the study of this problem in the data stream model, the state-of-the-art single-pass semi-strea...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 86; no. 4; pp. 1173 - 1209
Main Authors:	Feldman, Moran, Szarf, Ariel
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2024 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Approximation Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Data transmission Graphs Greedy algorithms Matching Mathematical analysis Mathematics of Computing Theory of Computation Maximum matching Semi-streaming algorithms Multi-pass algorithms Adversarial order streams
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!