External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

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]

Authors

Zhiyang He

This author has not been identified. Look up 'Zhiyang He' in Google

Jason Li

This author has not been identified. Look up 'Jason Li' in Google

Magnus Wahlström

This author has not been identified. Look up 'Magnus Wahlström' in Google
runs on