Zhiyang He, Jason Li, Magnus Wahlström. Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. In Petra Mutzel, Rasmus Pagh, Grzegorz Herman, editors, 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference). Volume 204 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{HeLW21-0,
title = {Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs},
author = {Zhiyang He and Jason Li and Magnus Wahlström},
year = {2021},
doi = {10.4230/LIPIcs.ESA.2021.52},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.52},
researchr = {https://researchr.org/publication/HeLW21-0},
cites = {0},
citedby = {0},
booktitle = {29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)},
editor = {Petra Mutzel and Rasmus Pagh and Grzegorz Herman},
volume = {204},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-204-4},
}