On the public citation graph
Fast Computation of Reachability Labeling for Large Graphs
0 signed · 117 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
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/978-3-540-24741-8_53openalex-snapshot
Hippo: A System for Computing Consistent Answers to a Class of SQL Queries
inferredcites →https://doi.org/10.1016/0020-0190(75)90019-8openalex-snapshot
On the vector representation of the reachability in planar directed graphs
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1109/icde.1999.754973openalex-snapshot
A graph query language and its query processing
inferredcites →https://doi.org/10.1109/icde.2001.914843openalex-snapshot
An XML indexing structure with relative region coordinate
inferredcites →https://doi.org/10.1109/icde.2003.1260808openalex-snapshot
PBiTree coding and efficient processing of containment joins
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.1137/0218003openalex-snapshot
A Fast Parametric Maximum Flow Algorithm and Applications
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/226931.226950openalex-snapshot
Index structures for structured documents
inferredcites →https://doi.org/10.1145/375663.375722openalex-snapshot
On supporting containment queries in relational database management systems
inferredcites →https://doi.org/10.1145/564691.564715openalex-snapshot
Storing and querying ordered XML using a relational database system
inferredcites →https://doi.org/10.1145/564712.564715openalex-snapshot
Storing and querying ordered XML using a relational database system
inferredcites →https://doi.org/10.1145/66926.66950openalex-snapshot
Efficient management of transitive relationships in large data and knowledge bases
inferredcites →https://doi.org/10.1145/67544.66950openalex-snapshot
Efficient management of transitive relationships in large data and knowledge bases
inferredcites →https://doi.org/10.1145/800125.804034openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.5555/545381.545505openalex-snapshot
A comparison of labeling schemes for ancestor queries
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11733836_47openalex-snapshot
Fast Reachability Query Processing
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0openalex-snapshot
Managing and Mining Graph Data
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_1openalex-snapshot
An Introduction to Graph Data
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_2openalex-snapshot
Graph Data Management and Mining: A Survey of Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_4openalex-snapshot
Query Language and Access Methods for Graph Databases
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_6openalex-snapshot
Graph Reachability Queries: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_9openalex-snapshot
A Survey of Clustering Algorithms for Graph Data
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-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-642-00887-0_12openalex-snapshot
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02279-1_29openalex-snapshot
Evaluating Reachability Queries over Path Collections
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-20244-5_6openalex-snapshot
Classifying Graphs Using Theoretical Metrics: A Study of Feasibility
inferred← citeshttps://doi.org/10.1007/978-90-481-9794-1_26openalex-snapshot
Data Engineering in Graph Databases
inferred← citeshttps://doi.org/10.1007/s00778-009-0141-6openalex-snapshot
Optimizing updates of recursive XML views of relations
inferred← citeshttps://doi.org/10.1007/s00778-011-0256-4openalex-snapshot
GRAIL: a scalable index for reachability queries in very large graphs
inferred← citeshttps://doi.org/10.1007/s00778-013-0346-6openalex-snapshot
Efficient processing of $$k$$ k -hop 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-021-00695-0openalex-snapshot
Answering reachability and K-reach queries on large graphs with label constraints
inferred← citeshttps://doi.org/10.1007/s10586-024-04814-8openalex-snapshot
TDS: fast answering reachability queries with hierarchical traversal trees
inferred← citeshttps://doi.org/10.1007/s11280-008-0050-4openalex-snapshot
Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document
inferred← citeshttps://doi.org/10.1007/s11280-016-0401-5openalex-snapshot
Para-G: Path pattern query processing on large 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/s11704-022-2368-yopenalex-snapshot
Answering reachability queries with ordered label constraints over labeled graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105233openalex-snapshot
Accelerating the calculation of makespan used in scheduling improvement heuristics
inferred← citeshttps://doi.org/10.1016/j.cose.2025.104525openalex-snapshot
PM k R: Privacy-preserving multi-keyword top- k reachability query
inferred← citeshttps://doi.org/10.1016/j.ifacol.2019.11.422openalex-snapshot
Recalculating the Length of the Longest Path in Perturbed Directed Acyclic Graph
inferred← citeshttps://doi.org/10.1016/j.ins.2021.05.053openalex-snapshot
Reachability in big graphs: A distributed indexing and querying approach
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.1080/00207543.2017.1407884openalex-snapshot
Efficient algorithm to find makespan in manufacturing systems under multiple scheduling perturbations
inferred← citeshttps://doi.org/10.1080/00207543.2021.2017057openalex-snapshot
A theoretical framework to accelerate scheduling improvement heuristics using a new longest path algorithm in perturbed DAGs
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/bigdata.congress.2013.34openalex-snapshot
SPTI: Efficient Answering the Shortest Path Query on Large Graphs
inferred← citeshttps://doi.org/10.1109/fskd.2013.6816303openalex-snapshot
Retaining all the path information for graph reachability queries based on regular expressions
inferred← citeshttps://doi.org/10.1109/icde.2008.4497498openalex-snapshot
An Efficient Algorithm for Answering Graph Reachability Queries
inferred← citeshttps://doi.org/10.1109/icde.2008.4497500openalex-snapshot
Fast Graph Pattern Matching
inferred← citeshttps://doi.org/10.1109/icde.2011.5767832openalex-snapshot
Decomposing DAGs into spanning trees: A new way to compress transitive closures
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00056openalex-snapshot
Reachability Labeling for Distributed Graphs
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.2010.5452732openalex-snapshot
Evaluating path queries over route collections
inferred← citeshttps://doi.org/10.1109/icdew.2014.6818298openalex-snapshot
Privacy-preserving reachability query services for sparse graphs
inferred← citeshttps://doi.org/10.1109/sitis.2008.31openalex-snapshot
Core Labeling: A New Way to Compress Transitive Closure
inferred← citeshttps://doi.org/10.1109/tbdata.2023.3327215openalex-snapshot
BL: An Efficient Index for Reachability Queries on Large Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2009.117openalex-snapshot
Incremental Maintenance of 2-Hop Labeling of Large Graphs
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.2016.2631160openalex-snapshot
Reachability Querying: Can It Be Even Faster?
inferred← citeshttps://doi.org/10.1109/tkde.2022.3220191openalex-snapshot
Evaluation of Reachability Queries Based on Recursive DAG Decomposition
inferred← citeshttps://doi.org/10.1109/tsc.2020.2969898openalex-snapshot
Providing Fast Reachability Query Services With MGTag: A Multi-Dimensional Graph Labeling Method
inferred← citeshttps://doi.org/10.1145/1247480.1247573openalex-snapshot
Fast and practical indexing and querying of very large graphs
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/1367497.1367611openalex-snapshot
On incremental maintenance of 2-hop labeling of graphs
inferred← citeshttps://doi.org/10.1145/1370256.1370293openalex-snapshot
A new method for generating compressed representation of transitive closure
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/1557626.1557665openalex-snapshot
General spanning trees and reachability query evaluation
inferred← citeshttps://doi.org/10.1145/1807167.1807183openalex-snapshot
Computing label-constraint reachability in graph databases
inferred← citeshttps://doi.org/10.1145/2247596.2247613openalex-snapshot
Transitive closure and recursive Datalog implemented on clusters
inferred← citeshttps://doi.org/10.1145/2505515.2505724openalex-snapshot
Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths
inferred← citeshttps://doi.org/10.1145/2530531openalex-snapshot
Shortest-path queries in static networks
inferred← citeshttps://doi.org/10.1145/2542050.2542092openalex-snapshot
Minimizing data transfers for regular reachability queries on distributed graphs
inferred← citeshttps://doi.org/10.1145/3035918.3035955openalex-snapshot
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries
inferred← citeshttps://doi.org/10.1145/3392717.3392745openalex-snapshot
Parallelizing pruned landmark labeling
inferred← citeshttps://doi.org/10.1145/3451159openalex-snapshot
Graph Indexing for Efficient Evaluation of Label-constrained Reachability Queries
inferred← citeshttps://doi.org/10.1145/3556540openalex-snapshot
O’Reach: Even Faster Reachability in Large 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/2556549.2556578openalex-snapshot
Simple, fast, and scalable reachability oracle
inferred← citeshttps://doi.org/10.14778/3380750.3380753openalex-snapshot
Answering billion-scale label-constrained reachability queries within microsecond
inferred← citeshttps://doi.org/10.14778/3648160.3648173openalex-snapshot
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs
inferred← citeshttps://doi.org/10.14778/3675034.3675049openalex-snapshot
I/O Efficient Label-Constrained Reachability Queries in Large Graphs
inferred← citeshttps://doi.org/10.3233/fi-2013-921openalex-snapshot
Generalized Hybrid Encoding of Polyhierarchical Structures
inferred← citeshttps://doi.org/10.32657/10356/42234openalex-snapshot
On incremental maintenance of 2-hop labeling of graphs
inferred← citeshttps://doi.org/10.32657/10356/53624openalex-snapshot
Efficient methods for querying and mining real-world graph data
inferred← citeshttps://doi.org/10.4018/978-1-61350-053-8.ch007openalex-snapshot
Labelling-Scheme-Based Subgraph Query Processing on Graph Data
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.1301.0977openalex-snapshot
DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs
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.2111.10095openalex-snapshot
An Index for Single Source All Destinations Distance Queries in Temporal Graphs
inferred← citeshttps://doi.org/10.5220/0001858300170024openalex-snapshot
DIRECTED ACYCLIC GRAPHS AND DISJOINT CHAINS
inferred← citeshttps://doi.org/10.70675/8f2473f4z0e53z4ab4z85bbzf70acd80fde8openalex-snapshot
Large-scale data management in real-world 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.