The power of vertex sparsifiers in dynamic graph algorithms

Goranci, G., Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2017) The power of vertex sparsifiers in dynamic graph algorithms. In: 25th Annual European Symposium on Algorithms (ESA 2017). 25th Annual European Symposium on Algorithms (ESA 2017), 04-08 Sep 2017, Vienna, Austria. Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 45:1-45:14. ISBN 978-3-95977-049-1

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © Gramoz Goranci, Monika Henzinger, and Pan Peng; licensed under Creative Commons License CC-BY (https://creativecommons.org/licenses/by/3.0/).
Keywords: Dynamic graph algorithms; electrical flow; minor-free graphs; max flow
Dates:
  • Published (online): 4 September 2017
  • Published: 4 September 2017
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 13 Jun 2019 15:25
Last Modified: 20 Jun 2019 21:20
Status: Published
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Refereed: Yes
Identification Number: https://doi.org/10.4230/LIPIcs.ESA.2017.45

Share / Export

Statistics