{"date_published":"2018-08-14T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2018","day":"14","intvolume":"       112","language":[{"iso":"eng"}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2018.40"}],"title":"Dynamic effective resistances and approximate schur complement on separable graphs","scopus_import":"1","quality_controlled":"1","citation":{"chicago":"Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” In <i>26th Annual European Symposium on Algorithms</i>, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">https://doi.org/10.4230/LIPICS.ESA.2018.40</a>.","ista":"Goranci G, Henzinger MH, Peng P. 2018. Dynamic effective resistances and approximate schur complement on separable graphs. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 40.","apa":"Goranci, G., Henzinger, M. H., &#38; Peng, P. (2018). Dynamic effective resistances and approximate schur complement on separable graphs. In <i>26th Annual European Symposium on Algorithms</i> (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">https://doi.org/10.4230/LIPICS.ESA.2018.40</a>","short":"G. Goranci, M.H. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","mla":"Goranci, Gramoz, et al. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” <i>26th Annual European Symposium on Algorithms</i>, vol. 112, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">10.4230/LIPICS.ESA.2018.40</a>.","ama":"Goranci G, Henzinger MH, Peng P. Dynamic effective resistances and approximate schur complement on separable graphs. In: <i>26th Annual European Symposium on Algorithms</i>. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">10.4230/LIPICS.ESA.2018.40</a>","ieee":"G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and approximate schur complement on separable graphs,” in <i>26th Annual European Symposium on Algorithms</i>, Helsinki, Finland, 2018, vol. 112."},"date_created":"2022-08-12T08:26:42Z","month":"08","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"status":"public","external_id":{"arxiv":["1802.09111"]},"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959770811"]},"volume":112,"date_updated":"2023-02-16T11:08:08Z","type":"conference","extern":"1","publication":"26th Annual European Symposium on Algorithms","publication_status":"published","abstract":[{"text":"We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an n^{c}-separator theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable (i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its separator can be computed in O~(n) time. Our algorithm is built upon a dynamic algorithm for maintaining approximate Schur complement that approximately preserves pairwise effective resistances among a set of terminals for separable graphs, which might be of independent interest.\r\nWe complement our result by proving that for any two fixed vertices s and t, no incremental or decremental algorithm can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless the Online Matrix Vector Multiplication (OMv) conjecture is false.\r\nWe further show that for general graphs, no incremental or decremental algorithm can maintain the s-t effective resistance problem with worst-case update time O(n^{1-delta}) and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false.","lang":"eng"}],"article_number":"40","conference":{"start_date":"2018-08-20","end_date":"2018-08-22","name":"ESA: Annual European Symposium on Algorithms","location":"Helsinki, Finland"},"author":[{"first_name":"Gramoz","full_name":"Goranci, Gramoz","last_name":"Goranci"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Peng","first_name":"Pan","full_name":"Peng, Pan"}],"doi":"10.4230/LIPICS.ESA.2018.40","_id":"11828","alternative_title":["LIPIcs"]}