A property is one-sided error testable in p-degenerate graphs if and only if its forbidden-subgraph violations cannot be fragmented across disjoint high-degree neighborhoods.
Property testing and its connection to learning and approximation
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2representative citing papers
Establishes near-optimal time bounds for SSPPR-A and SSPPR-R queries, with matching upper and lower bounds for SSPPR-R on graphs where m is Omega(n log squared n).
citing papers explorer
-
A characterization of one-sided error testable graph properties in bounded degeneracy graphs
A property is one-sided error testable in p-degenerate graphs if and only if its forbidden-subgraph violations cannot be fragmented across disjoint high-degree neighborhoods.
-
Near-Optimality for Single-Source Personalized PageRank
Establishes near-optimal time bounds for SSPPR-A and SSPPR-R queries, with matching upper and lower bounds for SSPPR-R on graphs where m is Omega(n log squared n).