Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Assadi, Sepehr, Behnezhad, Soheil, Konrad, Christian, Naidu, Kheeran K., Sundaresan, Janani
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2407.21005