Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Das, Syamantak, Kumar, Nikhil, Vaz, Daniel
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2407.09433