On the public citation graph

On the power of BFS to determine a graph's diameter

https://doi.org/10.1002/net.10098
0 signed · 43 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0166-218x(00)00281-xopenalex-snapshot
Diameter determination on restricted graph families
inferredcites →https://doi.org/10.1016/s0166-218x(99)00077-3openalex-snapshot
Almost diameter of a house-hole-free graph in linear time via LexBFS
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1109/sfcs.1996.548504openalex-snapshot
All pairs almost shortest paths
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/s0097539795282377openalex-snapshot
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
inferredcites →https://doi.org/10.1137/s0097539796303421openalex-snapshot
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
inferredcites →https://doi.org/10.1145/129712.129784openalex-snapshot
On the all-pairs-shortest-path problem
inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1287/trsc.7.3.287openalex-snapshot
Minimax Location of a Facility in an Undirected Tree Graph
inferredcites →https://doi.org/10.4064/fm-51-1-45-64openalex-snapshot
Representation of a finite graph by a set of intervals on the real line

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.20424openalex-snapshot
A decomposition for total‐coloring partial‐grids and list‐total‐coloring outerplanar graphs
inferred← citeshttps://doi.org/10.1002/net.21998openalex-snapshot
A story of diameter, radius, and (almost) Helly property
inferred← citeshttps://doi.org/10.1007/11764298_9openalex-snapshot
Fast and Simple Approximation of the Diameter and Radius of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_1openalex-snapshot
Fast Approximation of Centrality and Distances in Hyperbolic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-93409-5_17openalex-snapshot
Fellow Travelers Phenomenon Present in Real-World Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_20openalex-snapshot
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_31openalex-snapshot
The Complexity of Diameter on H-free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_29openalex-snapshot
Computing Giant Graph Diameters
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_16openalex-snapshot
Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_1openalex-snapshot
Lexicographic Breadth First Search – A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-68405-3_4openalex-snapshot
Incremental Map Generation (IMG)
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_25openalex-snapshot
How to Use Spanning Trees to Navigate in Graphs
inferred← citeshttps://doi.org/10.1007/978-981-15-0339-9_5openalex-snapshot
A Heuristic Algorithm for Diameter Calculation
inferred← citeshttps://doi.org/10.1007/s00453-012-9647-1openalex-snapshot
How to Use Spanning Trees to Navigate in Graphs
inferred← citeshttps://doi.org/10.1007/s00453-024-01223-6openalex-snapshot
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
inferred← citeshttps://doi.org/10.1007/s00453-025-01344-6openalex-snapshot
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
inferred← citeshttps://doi.org/10.1007/s11192-020-03602-6openalex-snapshot
Scientific collaboration in Russian universities before and after the excellence initiative Project 5-100
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.105873openalex-snapshot
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.033openalex-snapshot
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs
inferred← citeshttps://doi.org/10.1109/infocom.2008.227openalex-snapshot
Complex Network Measurements: Estimating the Relevance of Observed Properties
inferred← citeshttps://doi.org/10.1109/piere62470.2024.10805005openalex-snapshot
Uniqueness Control of Student Reports Based on MinHash Algorithm and Metrics for Picking Source Documents
inferred← citeshttps://doi.org/10.1111/itor.12236openalex-snapshot
Linear‐time graph distance and diameter approximation
inferred← citeshttps://doi.org/10.1137/090761549openalex-snapshot
Navigating in a Graph by Aid of Its Spanning Tree Metric
inferred← citeshttps://doi.org/10.1137/24m1677885openalex-snapshot
The Complexity of Diameter on \({H}\)-Free Graphs
inferred← citeshttps://doi.org/10.1145/1412228.1455266openalex-snapshot
Fast computation of empirically tight bounds for the diameter of massive graphs
inferred← citeshttps://doi.org/10.2172/1028919openalex-snapshot
Network topology analysis.
inferred← citeshttps://doi.org/10.48550/arxiv.1609.04593openalex-snapshot
Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1803.04660openalex-snapshot
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1910.10412openalex-snapshot
A story of diameter, radius and Helly property
inferred← citeshttps://doi.org/10.48550/arxiv.2105.12150openalex-snapshot
Diameter, radius and all eccentricities in linear time for constant-dimension median graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0609115openalex-snapshot
Measuring Fundamental Properties of Real-World Complex Networks
inferred← citeshttps://doi.org/10.7155/jgaa.00496openalex-snapshot
Fast approximation of eccentricities and distances in hyperbolic graphs
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.