On the public citation graph

Reachability and distance queries via 2-hop labels

0 signed · 156 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/(sici)1097-0118(200003)33:3<167::aid-jgt7>3.0.co;2-5openalex-snapshot
Proximity-preserving labeling schemes
inferredcites →https://doi.org/10.1006/jagm.1994.1032openalex-snapshot
Generating Sparse 2-Spanners
inferredcites →https://doi.org/10.1006/jagm.1996.0048openalex-snapshot
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
inferredcites →https://doi.org/10.1137/0218003openalex-snapshot
A Fast Parametric Maximum Flow Algorithm and Applications
inferredcites →https://doi.org/10.1145/1039488.1039493openalex-snapshot
Compact oracles for reachability and approximate distances in planar digraphs
inferredcites →https://doi.org/10.1145/380752.380798openalex-snapshot
Approximate distance oracles
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1287/moor.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem
inferredcites →https://doi.org/10.5555/365411.365447openalex-snapshot
Distance labeling in graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.2321openalex-snapshot
A graph-labeling approach for efficient cone-of-influence computation in model-checking problems with multiple properties
inferred← citeshttps://doi.org/10.1007/11563952_7openalex-snapshot
Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_5openalex-snapshot
Labeling Schemes for Dynamic Tree Networks
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0openalex-snapshot
Managing and Mining Graph Data
inferred← citeshttps://doi.org/10.1007/978-3-030-22871-2_3openalex-snapshot
Fast Replanning Incremental Shortest Path Algorithm for Dynamic Transportation Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-36687-2_10openalex-snapshot
The Densest k Subgraph Problem in b-Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-22363-6_2openalex-snapshot
COLD. Revisiting Hub Labels on the Database for Large-Scale Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-25255-1_46openalex-snapshot
AILabel: A Fast Interval Labeling Approach for Reachability Query on Very Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_9openalex-snapshot
Distance Queries in Large-Scale Fully Dynamic Complex Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-46565-4_17openalex-snapshot
Modified MinG Algorithm to Find Top-K Shortest Paths from large RDF Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24741-8_15openalex-snapshot
HOPI: An Efficient Connection Index for Complex XML Document Collections
inferred← citeshttps://doi.org/10.1007/978-3-540-31849-1_28openalex-snapshot
Labeling Scheme and Structural Joins for Graph-Structured XML Data
inferred← citeshttps://doi.org/10.1007/978-3-540-31970-2_6openalex-snapshot
HID: An Efficient Path Index for Complex XML Collections with Arbitrary Links
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_4openalex-snapshot
Compact Forbidden-Set Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_11openalex-snapshot
Labeling Schemes for Vertex Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_20openalex-snapshot
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors
inferred← citeshttps://doi.org/10.1007/978-3-540-88067-7_10openalex-snapshot
Indexing Structure for Graph-Structured Data
inferred← citeshttps://doi.org/10.1007/978-3-642-04329-1_14openalex-snapshot
Labeling RDF Graphs for Linear Time and Space Querying
inferred← citeshttps://doi.org/10.1007/978-3-642-04581-3_2openalex-snapshot
Four Lessons in Versatility or How Query Languages Adapt to the Web
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_32openalex-snapshot
An Optimal Labeling for Node Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-642-20149-3_32openalex-snapshot
BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-32281-5_25openalex-snapshot
Efficient Processing of Updates in Dynamic Graph-Structured XML Data
inferred← citeshttps://doi.org/10.1007/s00224-003-1106-6openalex-snapshot
Labeling Schemes for Dynamic Tree Networks
inferred← citeshttps://doi.org/10.1007/s00446-002-0073-5openalex-snapshot
Compact and localized distributed data structures
inferred← citeshttps://doi.org/10.1007/s00778-012-0274-xopenalex-snapshot
The exact distance to destination in undirected world
inferred← citeshttps://doi.org/10.1007/s00778-012-0288-4openalex-snapshot
Computing weight constraint reachability in large networks
inferred← citeshttps://doi.org/10.1007/s00778-021-00694-1openalex-snapshot
Distance labeling: on parallelism, compression, and ordering
inferred← citeshttps://doi.org/10.1007/s10115-017-1048-yopenalex-snapshot
A formal series-based unification of the frequent itemset mining approaches
inferred← citeshttps://doi.org/10.1007/s10707-016-0287-5openalex-snapshot
Hub Labels on the database for large-scale graphs with the COLD framework
inferred← citeshttps://doi.org/10.1007/s10791-005-0746-3openalex-snapshot
Semantic Similarity Search on Semistructured Data with the XXL Search Engine
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.1007/s40745-017-0119-yopenalex-snapshot
Approximate Shortest Distance Computing Using k-Medoids Clustering
inferred← citeshttps://doi.org/10.1007/s41019-019-00099-9openalex-snapshot
Modular Decomposition-Based Graph Compression for Fast Reachability Detection
inferred← citeshttps://doi.org/10.1016/j.ins.2020.08.111openalex-snapshot
Efficient single-pair all-shortest-path query processing for massive dynamic networks
inferred← citeshttps://doi.org/10.1016/j.jbi.2019.103171openalex-snapshot
An efficient reachability query based pruning algorithm in e-health scenario
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.07.013openalex-snapshot
Privacy-preserving k nearest neighbor query with authentication on road networks
inferred← citeshttps://doi.org/10.1016/j.knosys.2011.06.006openalex-snapshot
Data storage practices and query processing in XML databases: A survey
inferred← citeshttps://doi.org/10.1016/j.procs.2019.04.065openalex-snapshot
Identifying a Team of Experts in Social Networks using a Cultural Algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.036openalex-snapshot
A note on models for graph representations
inferred← citeshttps://doi.org/10.1016/j.websem.2013.08.001openalex-snapshot
k -nearest keyword search in RDF graphs
inferred← citeshttps://doi.org/10.1108/17440080910947312openalex-snapshot
Fast and efficient computation of reachability queries over linked XML documents' graphs
inferred← citeshttps://doi.org/10.1109/cloudcom.2017.36openalex-snapshot
Decentralized Search for Shortest Path Approximation in Large-Scale Complex Networks
inferred← citeshttps://doi.org/10.1109/iccnit.2011.6020908openalex-snapshot
MinG: An efficient algorithm to mine graphs for semantic associations
inferred← citeshttps://doi.org/10.1109/icde.2013.6544861openalex-snapshot
Finding distance-preserving subgraphs in large road networks
inferred← citeshttps://doi.org/10.1109/icde.2013.6544893openalex-snapshot
FERRARI: Flexible and efficient reachability range assignment for graph indexing
inferred← citeshttps://doi.org/10.1109/icdew.2010.5452732openalex-snapshot
Evaluating path queries over route collections
inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155401openalex-snapshot
PASID: Exploiting Indoor mmWave Deployments for Passive Intrusion Detection
inferred← citeshttps://doi.org/10.1109/mdm.2016.45openalex-snapshot
ParDiSP: A Partition-Based Framework for Distance and Shortest Path Queries on Road Networks
inferred← citeshttps://doi.org/10.1109/mdm.2017.39openalex-snapshot
The Hitchhiker's Guide to the Optimal Route Planning
inferred← citeshttps://doi.org/10.1109/msn.2014.45openalex-snapshot
How Could a Boy Influence a Girl?
inferred← citeshttps://doi.org/10.1109/npc.2007.166openalex-snapshot
Querying Graph-Structured Data
inferred← citeshttps://doi.org/10.1109/socialcom-passat.2012.73openalex-snapshot
Efficient Graph Models for Retrieving Top-k News Feeds from Ego Networks
inferred← citeshttps://doi.org/10.1109/tcbb.2015.2480056openalex-snapshot
A Framework for Identifying Genotypic Information from Clinical Records: Exploiting Integrated Ontology Structures to Transfer Annotations between ICD Codes and Gene Ontologies
inferred← citeshttps://doi.org/10.1109/tits.2022.3194523openalex-snapshot
Exploring Public Transport Transfer Opportunities for Pareto Search of Multicriteria Journeys
inferred← citeshttps://doi.org/10.1109/tkde.2010.169openalex-snapshot
Graph Pattern Matching: A Join/Semijoin Approach
inferred← citeshttps://doi.org/10.1109/tkde.2011.30openalex-snapshot
Evaluating Path Queries over Frequently Updated Route Collections
inferred← citeshttps://doi.org/10.1109/tkde.2013.43openalex-snapshot
Shortest Path Computing in Relational DBMSs
inferred← citeshttps://doi.org/10.1109/tkde.2016.2631160openalex-snapshot
Reachability Querying: Can It Be Even Faster?
inferred← citeshttps://doi.org/10.1109/wisa.2014.39openalex-snapshot
A Reachability Query Approach with Path Interval Labeling
inferred← citeshttps://doi.org/10.1137/1.9781611976700.31openalex-snapshot
Maximizing Cohesion and Separation in Graph Representation Learning: A Distance-aware Negative Sampling Approach
inferred← citeshttps://doi.org/10.1142/s0129054108005590openalex-snapshot
REACHABILITY ON SUFFIX TREE GRAPHS
inferred← citeshttps://doi.org/10.1145/1017074.1017087openalex-snapshot
Twig query processing over graph-structured XML data
inferred← citeshttps://doi.org/10.1145/1099554.1099708openalex-snapshot
Compact reachability labeling for graph-structured data
inferred← citeshttps://doi.org/10.1145/1352431.1352458openalex-snapshot
Fast computing reachability labelings for large graphs with high compression rate
inferred← citeshttps://doi.org/10.1145/1353343.1353370openalex-snapshot
Fast computing reachability labelings for large graphs with high compression rate
inferred← citeshttps://doi.org/10.1145/1376616.1376676openalex-snapshot
Efficient algorithms for exact ranked twig-pattern matching over graphs
inferred← citeshttps://doi.org/10.1145/1376616.1376677openalex-snapshot
Efficiently answering reachability queries on very large directed graphs
inferred← citeshttps://doi.org/10.1145/1516360.1516417openalex-snapshot
On-line exact shortest distance query processing
inferred← citeshttps://doi.org/10.1145/1559845.1559930openalex-snapshot
3-HOP
inferred← citeshttps://doi.org/10.1145/1718487.1718537openalex-snapshot
A sketch-based distance oracle for web-scale graphs
inferred← citeshttps://doi.org/10.1145/1721837.1721855openalex-snapshot
Labeling schemes for vertex connectivity
inferred← citeshttps://doi.org/10.1145/1807167.1807244openalex-snapshot
An optimal labeling scheme for workflow provenance using skeleton labels
inferred← citeshttps://doi.org/10.1145/1871437.1871457openalex-snapshot
Path-hop
inferred← citeshttps://doi.org/10.1145/1871437.1871503openalex-snapshot
Fast and accurate estimation of shortest paths in large graphs
inferred← citeshttps://doi.org/10.1145/1935826.1935879openalex-snapshot
Efficient online ad serving in a display advertising exchange
inferred← citeshttps://doi.org/10.1145/1989323.1989367openalex-snapshot
Neighborhood-privacy protected shortest distance computing in cloud
inferred← citeshttps://doi.org/10.1145/1989323.1989375openalex-snapshot
Labeling recursive workflow executions on-the-fly
inferred← citeshttps://doi.org/10.1145/1989323.1989419openalex-snapshot
A memory efficient reachability data structure through bit vector compression
inferred← citeshttps://doi.org/10.1145/2063576.2063792openalex-snapshot
Index structures and top-k join algorithms for native keyword search databases
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/2187836.2187891openalex-snapshot
Partitioned multi-indexing
inferred← citeshttps://doi.org/10.1145/2247596.2247614openalex-snapshot
Shortest-path queries for complex networks
inferred← citeshttps://doi.org/10.1145/2247596.2247651openalex-snapshot
I/O cost minimization
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.2465315openalex-snapshot
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
inferred← citeshttps://doi.org/10.1145/2487575.2487599openalex-snapshot
Maximizing acceptance probability for active friending in online social networks
inferred← citeshttps://doi.org/10.1145/2566486.2568007openalex-snapshot
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling
inferred← citeshttps://doi.org/10.1145/2588555.2612181openalex-snapshot
Reachability queries on large dynamic graphs
inferred← citeshttps://doi.org/10.1145/2723372.2749456openalex-snapshot
Efficient Route Planning on Public Transportation Networks
inferred← citeshttps://doi.org/10.1145/2736277.2741098openalex-snapshot
The K-clique Densest Subgraph Problem
inferred← citeshttps://doi.org/10.1145/2767386.2767421openalex-snapshot
Randomized Proof-Labeling Schemes
inferred← citeshttps://doi.org/10.1145/2783258.2783299openalex-snapshot
Locally Densest Subgraph Discovery
inferred← citeshttps://doi.org/10.1145/2882903.2915226openalex-snapshot
Distributed Set Reachability
inferred← citeshttps://doi.org/10.1145/2983323.2983731openalex-snapshot
Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks
inferred← citeshttps://doi.org/10.1145/2983323.2983799openalex-snapshot
Privacy-Preserving Reachability Query Services for Massive Networks
inferred← citeshttps://doi.org/10.1145/2990192openalex-snapshot
ReHub
inferred← citeshttps://doi.org/10.1145/3035918.3035927openalex-snapshot
DAG Reduction
inferred← citeshttps://doi.org/10.1145/3139958.3140029openalex-snapshot
Finding The Most Preferred Path
inferred← citeshttps://doi.org/10.1145/3299869.3319877openalex-snapshot
Scaling Distance Labeling on Small-World Networks
inferred← citeshttps://doi.org/10.1145/3299901openalex-snapshot
Fully Dynamic 2-Hop Cover Labeling
inferred← citeshttps://doi.org/10.1145/3433210.3453099openalex-snapshot
Efficient Graph Encryption Scheme for Shortest Path Queries
inferred← citeshttps://doi.org/10.1145/3474717.3486809openalex-snapshot
Efficient Shortest Distance Query Processing in Road Networks for Spatially Skewed Workloads
inferred← citeshttps://doi.org/10.1145/3488560.3498446openalex-snapshot
Efficient Reachability Query with Extreme Labeling Filter
inferred← citeshttps://doi.org/10.1145/3569169openalex-snapshot
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
inferred← citeshttps://doi.org/10.1145/3589272openalex-snapshot
HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs
inferred← citeshttps://doi.org/10.1145/3654960openalex-snapshot
On Querying Historical Connectivity in Temporal Graphs
inferred← citeshttps://doi.org/10.1145/3658644.3670305openalex-snapshot
PathGES: An Efficient and Secure Graph Encryption Scheme for Shortest Path Queries
inferred← citeshttps://doi.org/10.1145/3696410.3714603openalex-snapshot
SANS: Efficient Densest Subgraph Discovery over Relational Graphs without Materialization
inferred← citeshttps://doi.org/10.14393/ufu.te.2023.460openalex-snapshot
Efficient dynamic data structures for reachability queries on large temporal graphs
inferred← citeshttps://doi.org/10.14778/1453856.1453909openalex-snapshot
Hash-base subgraph query processing method for graph-structured XML documents
inferred← citeshttps://doi.org/10.14778/2095686.2095694openalex-snapshot
Relational approach for shortest path discovery over large graphs
inferred← citeshttps://doi.org/10.14778/2140436.2140442openalex-snapshot
Densest subgraph in streaming and MapReduce
inferred← citeshttps://doi.org/10.14778/2212351.2212355openalex-snapshot
Adding logical operators to tree pattern queries on graph-structured data
inferred← citeshttps://doi.org/10.14778/2350229.2350247openalex-snapshot
K-reach
inferred← citeshttps://doi.org/10.14778/2735479.2735486openalex-snapshot
Optimal enumeration
inferred← citeshttps://doi.org/10.14778/3401960.3401962openalex-snapshot
KClist++
inferred← citeshttps://doi.org/10.14778/3467861.3467873openalex-snapshot
Efficiently answering reachability and path queries on temporal bipartite graphs
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/3712221.3712241openalex-snapshot
A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks
inferred← citeshttps://doi.org/10.1527/tjsai.22.191openalex-snapshot
Fast Reachability Test on DAGs for XML
inferred← citeshttps://doi.org/10.1527/tjsai.b-f71openalex-snapshot
Fast Top-k Distance Retrieval for Network Structural Proximity Features
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9154openalex-snapshot
Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9368openalex-snapshot
Complexity Results for Compressing Optimal Paths
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21773openalex-snapshot
Light Contraction Hierarchies: Hierarchical Search Without Shortcuts
inferred← citeshttps://doi.org/10.1609/socs.v5i1.18311openalex-snapshot
Fast First-Move Queries through Run-Length Encoding
inferred← citeshttps://doi.org/10.1613/jair.4931openalex-snapshot
Compressing Optimal Paths with Run Length Encoding
inferred← citeshttps://doi.org/10.3233/fi-2013-921openalex-snapshot
Generalized Hybrid Encoding of Polyhierarchical Structures
inferred← citeshttps://doi.org/10.32657/10356/151191openalex-snapshot
Multi-criteria journey planning for enhancing user experience in multimodal transportation systems
inferred← citeshttps://doi.org/10.3390/computation8040103openalex-snapshot
Graph Reachability on Parallel Many-Core Architectures
inferred← citeshttps://doi.org/10.4218/etrij.2021-0261openalex-snapshot
GOMS: Large‐scale ontology management system using graph databases
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2016.132openalex-snapshot
Distance Labeling Schemes for Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1201.6567openalex-snapshot
Densest Subgraph in Streaming and MapReduce
inferred← citeshttps://doi.org/10.48550/arxiv.1208.0090openalex-snapshot
K-Reach: Who is in Your Small World
inferred← citeshttps://doi.org/10.48550/arxiv.1211.3375openalex-snapshot
High-Performance Reachability Query Processing under Index Size Restrictions
inferred← citeshttps://doi.org/10.48550/arxiv.1302.7025openalex-snapshot
Maximizing Acceptance Probability for Active Friending in On-Line Social Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1477openalex-snapshot
A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1504.01497openalex-snapshot
ReHub. Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale networks
inferred← citeshttps://doi.org/10.48550/arxiv.1512.06395openalex-snapshot
Effective Keyword Search in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1602.01537openalex-snapshot
TopCom: Index for Shortest Distance Query in Directed Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1906.12018openalex-snapshot
Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0605141openalex-snapshot
General Compact Labeling Schemes for Dynamic Trees
inferred← citeshttps://doi.org/10.5121/ijdms.2015.7403openalex-snapshot
Shortest Path Estimation for Graph Data Using a Relational Technique
inferred← citeshttps://doi.org/10.5441/002/edbt.2015.14openalex-snapshot
SIEF: Efficiently Answering Distance Queries for Failure Prone Graphs
inferred← citeshttps://doi.org/10.5441/002/edbt.2016.50openalex-snapshot
Scalable Public Transportation Queries on the Database
inferred← citeshttps://doi.org/10.5555/644108.644220openalex-snapshot
Labeling schemes for small distances in trees
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.