On the public citation graph

Compact Implicit Representation of Graphs

https://doi.org/10.1007/10692760_14
0 signed · 31 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/3-540-61769-8_14openalex-snapshot
Topological routing schemes
inferredcites →https://doi.org/10.1007/978-3-642-95486-3_22openalex-snapshot
Computer Networks with Compact Routing Tables
inferredcites →https://doi.org/10.1007/bf01185207openalex-snapshot
Algorithms for parallel memory, I: Two-level memories
inferredcites →https://doi.org/10.1007/bf01762113openalex-snapshot
Designing networks with compact routing tables
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1016/0020-0190(88)90058-0openalex-snapshot
Implicit data structures for linear hashing schemes
inferredcites →https://doi.org/10.1016/0022-0000(80)90037-9openalex-snapshot
Implicit data structures for fast search and update
inferredcites →https://doi.org/10.1016/0022-0000(86)90043-7openalex-snapshot
An implicit data structure supporting insertion, deletion, and search in Olog2n) time
inferredcites →https://doi.org/10.1016/0022-247x(67)90082-0openalex-snapshot
An unexpected result in coding the vertices of a graph
inferredcites →https://doi.org/10.1016/0166-218x(84)90126-4openalex-snapshot
On the succinct representation of graphs
inferredcites →https://doi.org/10.1093/comjnl/28.1.5openalex-snapshot
Labelling and Implicit Routing in Networks
inferredcites →https://doi.org/10.1093/comjnl/30.4.298openalex-snapshot
Interval Routing
inferredcites →https://doi.org/10.1109/tit.1966.1053860openalex-snapshot
Coding the vertexes of a graph
inferredcites →https://doi.org/10.1137/0218058openalex-snapshot
Efficient Message Routing in Planar Networks
inferredcites →https://doi.org/10.1137/0219011openalex-snapshot
Space-Efficient Message Routing in c -Decomposable Networks
inferredcites →https://doi.org/10.1137/0405049openalex-snapshot
Implicat Representation of Graphs
inferredcites →https://doi.org/10.1137/s0097539793254571openalex-snapshot
What Can be Computed Locally?
inferredcites →https://doi.org/10.1145/10590.10598openalex-snapshot
Optimal message routing without complete routing tables
inferredcites →https://doi.org/10.1145/322358.322364openalex-snapshot
Implicit Data Structures for the Dictionary Problem
inferredcites →https://doi.org/10.1515/9780773591158-007openalex-snapshot
Compact Routing Methods: A Survey

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-48447-7_34openalex-snapshot
Dynamic Representations of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_30openalex-snapshot
Efficient Searching for Multi—dimensional Data Made Simple
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_15openalex-snapshot
Join-Reachability Problems in Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00224-013-9450-7openalex-snapshot
Join-Reachability Problems in Directed Graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00225-0openalex-snapshot
Representing graphs implicitly using almost optimal space
inferred← citeshttps://doi.org/10.1109/focs.2015.84openalex-snapshot
Optimal Induced Universal Graphs and Adjacency Labeling for Trees
inferred← citeshttps://doi.org/10.1109/icsit65336.2025.11294376openalex-snapshot
Investigation of Compact Mean Labeling Using Complete Bipartite Graph
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181882openalex-snapshot
Small induced-universal graphs and compact implicit graph representations
inferred← citeshttps://doi.org/10.1145/3088513openalex-snapshot
Optimal Induced Universal Graphs and Adjacency Labeling for Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1806.01799openalex-snapshot
Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations
inferred← citeshttps://doi.org/10.5555/365411.365518openalex-snapshot
Orderly Spanning Trees with Applications to Graph Encoding and Graph Drawing
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.