On the public citation graph
Approximating average parameters of graphs
0 signed · 69 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.1006/jcss.1995.1078openalex-snapshot
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
inferredcites →https://doi.org/10.1006/jcss.1997.1385openalex-snapshot
All Pairs Shortest Paths for Graphs with Small Integer Length Edges
inferredcites →https://doi.org/10.1007/11523468_70openalex-snapshot
Facility Location in Sublinear Time
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/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1021/ja01193a005openalex-snapshot
Structural Determination of Paraffin Boiling Points
inferredcites →https://doi.org/10.1109/sfcs.1996.548504openalex-snapshot
All pairs almost shortest paths
inferredcites →https://doi.org/10.1109/sfcs.2001.959897openalex-snapshot
Planar graphs, negative weight edges, shortest paths, and near linear time
inferredcites →https://doi.org/10.1137/s0097539702403244openalex-snapshot
Approximating the Minimum Spanning Tree Weight in Sublinear Time
inferredcites →https://doi.org/10.1137/s0097539703436424openalex-snapshot
Tight Bounds for Testing Bipartiteness in General Graphs
inferredcites →https://doi.org/10.1137/s0097539704447304openalex-snapshot
On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.70017openalex-snapshot
Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_703openalex-snapshot
Estimating Simple Graph Parameters in Sublinear Time
inferred← citeshttps://doi.org/10.1007/978-3-030-57980-7_14openalex-snapshot
Targeted Intervention in Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_18openalex-snapshot
Deterministic Metric 1-median Selection with a $$1-o(1)$$ Fraction of Points Ignored
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_12openalex-snapshot
Improved Sublinear-Time Moment Estimation Using Weighted Sampling
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_7openalex-snapshot
Sublinear-Time Algorithms for Approximating Graph Parameters
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_8openalex-snapshot
Separating Sublinear Time Computations by Approximate Diameter
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_5openalex-snapshot
Sublinear-time Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_7openalex-snapshot
Introduction to Testing Graph Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_26openalex-snapshot
Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_32openalex-snapshot
Introduction to Testing Graph Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_35openalex-snapshot
Contemplations on Testing Graph Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_703-1openalex-snapshot
Estimating Simple Graph Parameters in Sublinear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_14openalex-snapshot
Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1007/s00037-012-0048-2openalex-snapshot
Comparing the strength of query types in property testing: The case of k-colorability
inferred← citeshttps://doi.org/10.1007/s00224-021-10043-yopenalex-snapshot
On Triangle Estimation Using Tripartite Independent Set Queries
inferred← citeshttps://doi.org/10.1007/s00453-017-0287-3openalex-snapshot
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
inferred← citeshttps://doi.org/10.1007/s00453-024-01208-5openalex-snapshot
Sublinear Time Eigenvalue Approximation via Random Sampling
inferred← citeshttps://doi.org/10.1007/s10878-009-9248-3openalex-snapshot
Separating sublinear time computations by approximate diameter
inferred← citeshttps://doi.org/10.1007/s41109-019-0230-4openalex-snapshot
Toward epidemic thresholds on temporal networks: a review and open questions
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.02.003openalex-snapshot
Deterministic sublinear-time approximations for metric 1-median selection
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.02.007openalex-snapshot
On Las Vegas approximations for metric 1-median selection
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.08.004openalex-snapshot
A lower bound for metric 1-median selection
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.02.002openalex-snapshot
Almost optimal query algorithm for hitting set using a subset query
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.003openalex-snapshot
Some results on approximate 1-median selection in metric spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.040openalex-snapshot
Sublinear-time algorithms for monomer–dimer systems on bounded degree graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.04.021openalex-snapshot
On ultrametric 1-median selection
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114720openalex-snapshot
Deterministic metric 1-median selection with very few queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115121openalex-snapshot
Lower bounds for graph reconstruction with maximal independent set queries
inferred← citeshttps://doi.org/10.1093/biomet/asac032openalex-snapshot
Subsampling sparse graphons under minimal assumptions
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029371openalex-snapshot
Structural Robustness to Noise in Consensus Networks: Impact of Average Degrees and Average Distances
inferred← citeshttps://doi.org/10.1109/focs.2015.44openalex-snapshot
Approximately Counting Triangles in Sublinear Time
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00089openalex-snapshot
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
inferred← citeshttps://doi.org/10.1109/icc.2015.7248497openalex-snapshot
Estimating the size and average degree of online social networks at the extreme
inferred← citeshttps://doi.org/10.1109/infcomw.2016.7562063openalex-snapshot
Average degree estimation under ego-centric sampling design
inferred← citeshttps://doi.org/10.1109/tac.2020.3035731openalex-snapshot
Structural Robustness to Noise in Consensus Networks: Impact of Degrees and Distances, Fundamental Limits, and Extremal Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973730.112openalex-snapshot
Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
inferred← citeshttps://doi.org/10.1137/1.9781611975031.136openalex-snapshot
Testing Bounded Arboricity
inferred← citeshttps://doi.org/10.1137/1.9781611975994.178openalex-snapshot
A Lower Bound on Cycle-Finding in Sparse Digraphs
inferred← citeshttps://doi.org/10.1137/1.9781611975994.180openalex-snapshot
Sublinear time approximation of the cost of a metric k-nearest neighbor graph
inferred← citeshttps://doi.org/10.1137/100783066openalex-snapshot
Counting Stars and Other Small Subgraphs in Sublinear-Time
inferred← citeshttps://doi.org/10.1137/15m1054389openalex-snapshot
Approximately Counting Triangles in Sublinear Time
inferred← citeshttps://doi.org/10.1137/17m1159014openalex-snapshot
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection
inferred← citeshttps://doi.org/10.1137/18m1176701openalex-snapshot
On Approximating the Number of $k$-Cliques in Sublinear Time
inferred← citeshttps://doi.org/10.1137/22m1544105openalex-snapshot
Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph
inferred← citeshttps://doi.org/10.1145/3178876.3186111openalex-snapshot
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples
inferred← citeshttps://doi.org/10.1145/3404867openalex-snapshot
Edge Estimation with Independent Set Oracles
inferred← citeshttps://doi.org/10.1145/3519935.3520059openalex-snapshot
Edge sampling and graph parameter estimation via vertex neighborhood accesses
inferred← citeshttps://doi.org/10.1214/20-ejs1789openalex-snapshot
Bootstrap estimators for the tail-index and for the count statistics of graphex processes
inferred← citeshttps://doi.org/10.1214/21-aos2134openalex-snapshot
Motif estimation via subgraph sampling: The fourth-moment phenomenon
inferred← citeshttps://doi.org/10.1214/24-ejs2309openalex-snapshot
Subsampling-based modified Bayesian information criterion for large-scale stochastic block models
inferred← citeshttps://doi.org/10.24963/ijcai.2020/457openalex-snapshot
Inferring Degrees from Incomplete Networks and Nonlinear Dynamics
inferred← citeshttps://doi.org/10.3150/19-bej1147openalex-snapshot
Estimating the number of connected components in a graph via subgraph sampling
inferred← citeshttps://doi.org/10.4230/dagsemproc.05291.3openalex-snapshot
Contemplations on Testing Graph Properties
inferred← citeshttps://doi.org/10.70675/43dbb94ez355ez42d2za9e8z47c1e9983ab9openalex-snapshot
Quantum algorithms for the Monte Carlo method
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.