8 citations · 24 across the 23 of their papers we have counts for
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
Hendrik Fichtenberger, Pan Peng, Christian Sohler
One of the most fundamental questions in graph property testing is to characterize the combinatorial structure of properties that are testable with a constant number of queries. We…
cs.DS2018
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs
Gramoz Goranci, Monika Henzinger, Pan Peng
We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an -separator theorem for so…