On the public citation graph
Planar Graphs: Random Walks and Bipartiteness Testing
0 signed · 37 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-16367-8openalex-snapshot
Property testing: current research and surveys
inferredcites →https://doi.org/10.1007/978-3-642-22670-0_9openalex-snapshot
On Testing Expansion in Bounded-Degree Graphs
inferredcites →https://doi.org/10.1007/s00453-001-0078-7openalex-snapshot
Property Testing in Bounded Degree Graphs
inferredcites →https://doi.org/10.1007/s004930050060openalex-snapshot
A Sublinear Bipartiteness Tester for Bounded Degree Graphs
inferredcites →https://doi.org/10.1016/j.aim.2009.10.018openalex-snapshot
Every minor-closed property of sparse graphs is testable
inferredcites →https://doi.org/10.1109/focs.2007.33openalex-snapshot
Testing Expansion in Bounded-Degree Graphs
inferredcites →https://doi.org/10.1109/focs.2007.69openalex-snapshot
Balloon Popping With Applications to Ascending Auctions
inferredcites →https://doi.org/10.1109/focs.2008.81openalex-snapshot
Constant-Time Approximation Algorithms via Local Improvements
inferredcites →https://doi.org/10.1109/focs.2009.77openalex-snapshot
Local Graph Partitions for Approximation and Testing
inferredcites →https://doi.org/10.1109/sfcs.2002.1181886openalex-snapshot
A lower bound for testing 3-colorability in bounded-degree graphs
inferredcites →https://doi.org/10.1137/060667177openalex-snapshot
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
inferredcites →https://doi.org/10.1137/070681831openalex-snapshot
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
inferredcites →https://doi.org/10.1137/s0097539703436424openalex-snapshot
Tight Bounds for Testing Bipartiteness in General Graphs
inferredcites →https://doi.org/10.1145/1497290.1497298openalex-snapshot
Approximating the distance to properties in bounded-degree and general sparse graphs
inferredcites →https://doi.org/10.1145/167088.167261openalex-snapshot
Excluded minors, network decomposition, and multicommodity flow
inferredcites →https://doi.org/10.1145/1993636.1993726openalex-snapshot
Every property of hyperfinite graphs is testable
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-04693-4_12openalex-snapshot
Sublinear Graph Augmentation for Fast Query Implementation
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_4openalex-snapshot
What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure?
inferred← citeshttps://doi.org/10.1007/978-981-95-0218-9_8openalex-snapshot
Testing Some First-Order Logic Properties on Sparse Graphs
inferred← citeshttps://doi.org/10.1007/s00446-020-00382-3openalex-snapshot
Property Testing of Planarity in the CONGEST model
inferred← citeshttps://doi.org/10.1007/s00453-018-0520-8openalex-snapshot
Dynamic Graph Stream Algorithms in o(n) Space
inferred← citeshttps://doi.org/10.1007/s12626-019-00051-3openalex-snapshot
Hyperfiniteness of Real-World Networks
inferred← citeshttps://doi.org/10.1017/9781108135252openalex-snapshot
Introduction to Property Testing
inferred← citeshttps://doi.org/10.1109/apwc-on-cse.2016.014openalex-snapshot
Constant-Time Algorithms for Complex Networks
inferred← citeshttps://doi.org/10.1109/focs.2019.00089openalex-snapshot
A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs)
inferred← citeshttps://doi.org/10.1109/smart55829.2022.10046959openalex-snapshot
Graph Family Characterization using the Path Length Array
inferred← citeshttps://doi.org/10.1137/1.9781611975031.136openalex-snapshot
Testing Bounded Arboricity
inferred← citeshttps://doi.org/10.1137/1.9781611977073.69openalex-snapshot
The complexity of testing all properties of planar graphs, and the role of isomorphism
inferred← citeshttps://doi.org/10.22028/d291-26607openalex-snapshot
Random walk-based algorithms on networks
inferred← citeshttps://doi.org/10.48550/arxiv.1605.00089openalex-snapshot
Dynamic Graph Stream Algorithms in $o(n)$ Space
inferred← citeshttps://doi.org/10.48550/arxiv.1909.10647openalex-snapshot
A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs)
inferred← citeshttps://doi.org/10.48550/arxiv.2002.11713openalex-snapshot
Trapping problem on star-type graphs with applications
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.