Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs

Goranci, G., Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2018) Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. In: Proceedings of the 26th European Symposium on Algorithms (ESA 2018). The 26th European Symposium on Algorithms (ESA 2018), 20-22 Aug 2018, Helsinki, Finland. LIPIcs, 112 (40). Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Germany . ISBN 978-3-95977-081-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; effective resistance; separable graphs; Schur complement; conditional lower bounds
Dates:
  • Published (online): 16 August 2018
  • Published: 16 August 2018
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: 23 Aug 2018 13:38
Last Modified: 08 Oct 2018 13:30
Published Version: https://doi.org//10.4230/LIPIcs.ESA.2018.40
Status: Published
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Series Name: LIPIcs
Refereed: Yes
Identification Number: https://doi.org/10.4230/LIPIcs.ESA.2018.40

Share / Export

Statistics