On the public citation graph

Incremental Maintenance of 2-Hop Labeling of Large Graphs

0 signed · 77 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.1002/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1006/jagm.2001.1196openalex-snapshot
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property
inferredcites →https://doi.org/10.1007/11687238_56openalex-snapshot
Fast Computation of Reachability Labeling for Large Graphs
inferredcites →https://doi.org/10.1007/11733836_47openalex-snapshot
Fast Reachability Query Processing
inferredcites →https://doi.org/10.1007/11733836_56openalex-snapshot
Adapting Prime Number Labeling Scheme for Directed Acyclic Graphs
inferredcites →https://doi.org/10.1007/978-3-540-24741-8_15openalex-snapshot
HOPI: An Efficient Connection Index for Complex XML Document Collections
inferredcites →https://doi.org/10.1007/s00778-009-0141-6openalex-snapshot
Optimizing updates of recursive XML views of relations
inferredcites →https://doi.org/10.1016/s0166-218x(03)00333-0openalex-snapshot
The maximum edge biclique problem is NP-complete
inferredcites →https://doi.org/10.1081/e-elis4-120043688openalex-snapshot
Resource Description Framework (RDF)
inferredcites →https://doi.org/10.1093/nar/gki108openalex-snapshot
EcoCyc: a comprehensive database resource for Escherichia coli
inferredcites →https://doi.org/10.1109/icde.2003.1260797openalex-snapshot
XR-tree: indexing XML data for efficient structural joins
inferredcites →https://doi.org/10.1109/icde.2004.1319985openalex-snapshot
A prime number labeling scheme for dynamic ordered XML trees
inferredcites →https://doi.org/10.1109/icde.2005.57openalex-snapshot
Efficient Creation and Incremental Maintenance of the HOPI Index for Complex XML Document Collections
inferredcites →https://doi.org/10.1109/icde.2006.53openalex-snapshot
Dual Labeling: Answering Graph Reachability Queries in Constant Time
inferredcites →https://doi.org/10.1109/icde.2007.367922openalex-snapshot
Updating Recursive XML Views of Relations
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/s0097539702403098openalex-snapshot
Reachability and Distance Queries via 2-Hop Labels
inferredcites →https://doi.org/10.1145/107004.107032openalex-snapshot
A graph generation software package
inferredcites →https://doi.org/10.1145/107005.107032openalex-snapshot
A graph generation software package
inferredcites →https://doi.org/10.1145/1081870.1081893openalex-snapshot
Graphs over time
inferredcites →https://doi.org/10.1145/1114244.1114248openalex-snapshot
Graph indexing based on discriminative frequent structure analysis
inferredcites →https://doi.org/10.1145/1189769.1189777openalex-snapshot
Feature-based similarity search in graph structures
inferredcites →https://doi.org/10.1145/1247480.1247574openalex-snapshot
Fg-index
inferredcites →https://doi.org/10.1145/1353343.1353370openalex-snapshot
Fast computing reachability labelings for large graphs with high compression rate
inferredcites →https://doi.org/10.1145/1367497.1367611openalex-snapshot
On incremental maintenance of 2-hop labeling of graphs
inferredcites →https://doi.org/10.1145/263867.263872openalex-snapshot
A simple min-cut algorithm
inferredcites →https://doi.org/10.1145/324133.324140openalex-snapshot
Authoritative sources in a hyperlinked environment
inferredcites →https://doi.org/10.1145/375663.375722openalex-snapshot
On supporting containment queries in relational database management systems
inferredcites →https://doi.org/10.1145/376284.375722openalex-snapshot
On supporting containment queries in relational database management systems
inferredcites →https://doi.org/10.1145/543613.543648openalex-snapshot
Labeling dynamic XML trees
inferredcites →https://doi.org/10.1145/543645.543648openalex-snapshot
Labeling dynamic XML trees

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-73197-7_52openalex-snapshot
DBL: Efficient Reachability Queries on Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-05810-8_14openalex-snapshot
Privacy-Preserving Reachability Query Services
inferred← citeshttps://doi.org/10.1007/978-3-319-55699-4_41openalex-snapshot
Edge Influence Computation in Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-37453-1_16openalex-snapshot
Spectral Decomposition for Optimal Graph Index Prediction
inferred← citeshttps://doi.org/10.1007/978-90-481-9794-1_26openalex-snapshot
Data Engineering in Graph Databases
inferred← citeshttps://doi.org/10.1007/978-981-13-1747-7_40openalex-snapshot
A BFS-Based Pruning Algorithm for Disease-Symptom Knowledge Graph Database
inferred← citeshttps://doi.org/10.1007/978-981-96-8295-9_4openalex-snapshot
A Survey on Efficient Graph Reachability Queries
inferred← citeshttps://doi.org/10.1007/s00778-017-0468-3openalex-snapshot
Reachability querying: an independent permutation labeling approach
inferred← citeshttps://doi.org/10.1007/s00778-024-00854-zopenalex-snapshot
Efficient algorithms for reachability and path queries on temporal bipartite graphs
inferred← citeshttps://doi.org/10.1007/s00778-025-00951-7openalex-snapshot
On Querying Historical Connectivity in Large-scale Temporal Graphs
inferred← citeshttps://doi.org/10.1007/s11280-016-0421-1openalex-snapshot
Efficient computation of distance labeling for decremental updates in large dynamic graphs
inferred← citeshttps://doi.org/10.1007/s11390-016-1633-7openalex-snapshot
Answering Reachability Queries on Incrementally Updated Graphs by Hierarchical Labeling Schema
inferred← citeshttps://doi.org/10.1016/j.ins.2020.02.028openalex-snapshot
Reachability preserving compression for dynamic graph
inferred← citeshttps://doi.org/10.1016/j.is.2013.10.003openalex-snapshot
Efficient processing of label-constraint reachability queries in large graphs
inferred← citeshttps://doi.org/10.1109/icde.2016.7498236openalex-snapshot
Reachability and time-based path queries in temporal graphs
inferred← citeshttps://doi.org/10.1109/icde.2019.00049openalex-snapshot
ARROW: Approximating Reachability Using Random Walks Over Web-Scale Graphs
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00090openalex-snapshot
HL-Index: Fast Reachability Query in Hypergraphs
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00177openalex-snapshot
Lightweight 2-Hop Labels for Reachability Queries on Large-Scale Graphs
inferred← citeshttps://doi.org/10.1109/icdew.2014.6818298openalex-snapshot
Privacy-preserving reachability query services for sparse graphs
inferred← citeshttps://doi.org/10.1109/icdew.2019.000-9openalex-snapshot
Reachability in Large Graphs Using Bloom Filters
inferred← citeshttps://doi.org/10.1109/icycs.2008.352openalex-snapshot
A New Algorithm for Network Diameter
inferred← citeshttps://doi.org/10.1145/2063576.2063807openalex-snapshot
Answering label-constraint reachability in large graphs
inferred← citeshttps://doi.org/10.1145/2063576.2063966openalex-snapshot
Predicting the optimal ad-hoc index for reachability queries on graph databases
inferred← citeshttps://doi.org/10.1145/2396761.2396881openalex-snapshot
Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs
inferred← citeshttps://doi.org/10.1145/2463676.2467799openalex-snapshot
Trinity
inferred← citeshttps://doi.org/10.1145/2588555.2612181openalex-snapshot
Reachability queries on large dynamic graphs
inferred← citeshttps://doi.org/10.1145/2983323.2983799openalex-snapshot
Privacy-Preserving Reachability Query Services for Massive Networks
inferred← citeshttps://doi.org/10.1145/3555041.3589408openalex-snapshot
An Overview of Reachability Indexes on Graphs
inferred← citeshttps://doi.org/10.1145/3654960openalex-snapshot
On Querying Historical Connectivity in Temporal Graphs
inferred← citeshttps://doi.org/10.1145/3698805openalex-snapshot
Constant-time Connectivity Querying in Dynamic Graphs
inferred← citeshttps://doi.org/10.1145/3767166openalex-snapshot
ReachCheck: Compositional Library-Aware Call Graph Reachability Analysis in the IDEs
inferred← citeshttps://doi.org/10.1145/3776737openalex-snapshot
Indexing Techniques for Graph Reachability Queries
inferred← citeshttps://doi.org/10.1155/2019/4047894openalex-snapshot
Semantic‐Aware Top‐k Multirequest Optimal Route
inferred← citeshttps://doi.org/10.14778/2311906.2311907openalex-snapshot
Efficient subgraph matching on billion node graphs
inferred← citeshttps://doi.org/10.14778/2732977.2732992openalex-snapshot
Reachability querying
inferred← citeshttps://doi.org/10.14778/3529337.3529348openalex-snapshot
DLCR
inferred← citeshttps://doi.org/10.14778/3551793.3551868openalex-snapshot
Dynamic spanning trees for connectivity queries on fully-dynamic undirected graphs
inferred← citeshttps://doi.org/10.14778/3603581.3603584openalex-snapshot
Task: An Efficient Framework for Instant Error-Tolerant Spatial Keyword Queries on Road Networks
inferred← citeshttps://doi.org/10.14778/3648160.3648173openalex-snapshot
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs
inferred← citeshttps://doi.org/10.17485/ijst/2016/v9i16/87966openalex-snapshot
Survey on Signatured Xml Encryption for Multi-Tier Web Services Security
inferred← citeshttps://doi.org/10.32657/10356/61838openalex-snapshot
Efficient query processing on large graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1204.6535openalex-snapshot
Citations, Sequence Alignments, Contagion, and Semantics: On Acyclic Structures and their Randomness
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0977openalex-snapshot
DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1601.05909openalex-snapshot
Efficient Processing of Reachability and Time-Based Path Queries in a Temporal Graph
inferred← citeshttps://doi.org/10.48550/arxiv.2101.09441openalex-snapshot
DBL: Efficient Reachability Queries on Dynamic Graphs (Complete Version)
inferred← citeshttps://doi.org/10.5441/002/edbt.2015.14openalex-snapshot
SIEF: Efficiently Answering Distance Queries for Failure Prone 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.