On the public citation graph

Monitoring the links of a network using $k$-distances

0 signed · 19 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.1007/11604686_12openalex-snapshot
Network Discovery and Verification
inferredcites →https://doi.org/10.1007/978-1-84628-970-5openalex-snapshot
Graph Theory
inferredcites →https://doi.org/10.1007/978-3-319-15010-9openalex-snapshot
Semi-Autonomous Networks
inferredcites →https://doi.org/10.1007/s00236-024-00453-zopenalex-snapshot
Distance-edge-monitoring sets of networks
inferredcites →https://doi.org/10.1007/s11277-013-1334-2openalex-snapshot
Adding the Reliability on Tree Based Topology Construction Algorithms for Wireless Sensor Networks
inferredcites →https://doi.org/10.1016/j.dam.2021.07.002openalex-snapshot
Monitoring the edges of a graph using distances
inferredcites →https://doi.org/10.1016/j.dam.2023.06.033openalex-snapshot
Monitoring edge-geodetic sets: Hardness and graph products
inferredcites →https://doi.org/10.1016/j.dam.2023.09.012openalex-snapshot
On the distance-edge-monitoring numbers of graphs
inferredcites →https://doi.org/10.1016/j.dam.2023.09.020openalex-snapshot
Erdös–Gallai-type problems for distance-edge-monitoring numbers
inferredcites →https://doi.org/10.1016/j.dam.2024.12.032openalex-snapshot
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
inferredcites →https://doi.org/10.1016/j.dam.2025.03.015openalex-snapshot
The distance-edge-monitoring numbers of subdivision graphs
inferredcites →https://doi.org/10.1016/j.dam.2025.04.040openalex-snapshot
Nordhaus–Gaddum-type results for monitoring edge-geodetic number of graphs
inferredcites →https://doi.org/10.1016/j.jcss.2014.06.003openalex-snapshot
Network verification via routing table queries
inferredcites →https://doi.org/10.1016/j.jcss.2024.103528openalex-snapshot
Monitoring the edges of a graph using distances with given girth
inferredcites →https://doi.org/10.1016/j.parco.2009.12.004openalex-snapshot
Reducing complexity in tree-like computer interconnection networks
inferredcites →https://doi.org/10.1016/j.tcs.2005.12.009openalex-snapshot
Exploring networks with traceroute-like probes: Theory and simulations
inferredcites →https://doi.org/10.1016/j.tcs.2010.01.010openalex-snapshot
Discovery of network properties with all-shortest-paths queries
inferredcites →https://doi.org/10.1051/ro/2024106openalex-snapshot
Realizability problem of distance-edge-monitoring numbers
inferredcites →https://doi.org/10.1109/tnet.2006.882907openalex-snapshot
Robust Monitoring of Link Delays and Faults in IP Networks
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.