Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Downloads (Pure)

Original language	English
Title of host publication	Proceedings of ESA 2021
Publisher	Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Pages	1-14
Number of pages	14
ISBN (Electronic)	978-3-95977-204-4
DOIs	https://doi.org/10.4230/LIPIcs.ESA.2021.52
Publication status	E-pub ahead of print - 3 Jul 2021

Access to Document

@inproceedings{e02a08b530464ac6a8f8b7580d6d3625,

title = "Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs",

author = "Zhiyang He and Jason Li and Magnus Wahlstr{\"o}m",

year = "2021",

month = jul,

day = "3",

doi = "10.4230/LIPIcs.ESA.2021.52",

language = "English",

pages = "1--14",

booktitle = "Proceedings of ESA 2021",

publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik",

}

TY - GEN

T1 - Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs

AU - He, Zhiyang

AU - Li, Jason

AU - Wahlström, Magnus

PY - 2021/7/3

Y1 - 2021/7/3

U2 - 10.4230/LIPIcs.ESA.2021.52

DO - 10.4230/LIPIcs.ESA.2021.52

M3 - Conference contribution

SP - 1

EP - 14

BT - Proceedings of ESA 2021

PB - Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

ER -