Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs

DOI10.4230/LIPICS.ESA.2021.52arXiv2011.13485OpenAlexW3197365035MaRDI QIDQ6075944

Zhiyang He, Magnus Wahlström, Jason Li

Publication date: 20 September 2023

Full work available at URL: https://arxiv.org/abs/2011.13485

zbMATH Keywords

graph theorymatroidrepresentative familyvertex sparsifier

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs