On the public citation graph
Graph Indexing for Efficient Evaluation of Label-constrained Reachability Queries
0 signed · 68 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/11687238_56openalex-snapshot
Fast Computation of Reachability Labeling for Large Graphs
inferredcites →https://doi.org/10.1007/978-3-030-35514-2_19openalex-snapshot
Approximate Querying on Property Graphs
inferredcites →https://doi.org/10.1007/s00778-009-0165-yopenalex-snapshot
The RDF-3X engine for scalable management of RDF data
inferredcites →https://doi.org/10.1007/s00778-018-0495-8openalex-snapshot
Accelerating reachability query processing based on $$\varvec{DAG}$$ DAG reduction
inferredcites →https://doi.org/10.1016/0020-0190(71)90006-8openalex-snapshot
Efficient determination of the transitive closure of a directed graph
inferredcites →https://doi.org/10.1016/j.is.2013.10.003openalex-snapshot
Efficient processing of label-constraint reachability queries in large graphs
inferredcites →https://doi.org/10.1080/00107510500052444openalex-snapshot
Power laws, Pareto distributions and Zipf's law
inferredcites →https://doi.org/10.1109/comst.2006.253270openalex-snapshot
Survey of security vulnerabilities in session initiation protocol
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.2008.4497498openalex-snapshot
An Efficient Algorithm for Answering Graph Reachability Queries
inferredcites →https://doi.org/10.1109/icde.2011.5767832openalex-snapshot
Decomposing DAGs into spanning trees: A new way to compress transitive closures
inferredcites →https://doi.org/10.1109/mc.1983.1654198openalex-snapshot
Determining Type, Part, Color, and Time Relationships
inferredcites →https://doi.org/10.1109/sitis.2008.31openalex-snapshot
Core Labeling: A New Way to Compress Transitive Closure
inferredcites →https://doi.org/10.1109/tkde.2016.2631160openalex-snapshot
Reachability Querying: Can It Be Even Faster?
inferredcites →https://doi.org/10.1109/tkde.2016.2633993openalex-snapshot
gMark: Schema-Driven Generation of Graphs and Queries
inferredcites →https://doi.org/10.1137/s0097539702403098openalex-snapshot
Reachability and Distance Queries via 2-Hop Labels
inferredcites →https://doi.org/10.1137/s009753979122370xopenalex-snapshot
Finding Regular Simple Paths in Graph Databases
inferredcites →https://doi.org/10.1137/s0097539798337716openalex-snapshot
Formal-Language-Constrained Path Problems
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/1376616.1376677openalex-snapshot
Efficiently answering reachability queries on very large directed graphs
inferredcites →https://doi.org/10.1145/1807167.1807183openalex-snapshot
Computing label-constraint reachability in graph databases
inferredcites →https://doi.org/10.1145/1989323.1989419openalex-snapshot
A memory efficient reachability data structure through bit vector compression
inferredcites →https://doi.org/10.1145/2063576.2063807openalex-snapshot
Answering label-constraint reachability in large graphs
inferredcites →https://doi.org/10.1145/2206869.2206879openalex-snapshot
Query languages for graph databases
inferredcites →https://doi.org/10.1145/2505515.2507818openalex-snapshot
Label constrained shortest path estimation
inferredcites →https://doi.org/10.1145/2588555.2612181openalex-snapshot
Reachability queries on large dynamic graphs
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1145/2882903.2882933openalex-snapshot
Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs
inferredcites →https://doi.org/10.1145/2882903.2882944openalex-snapshot
Query Planning for Evaluating SPARQL Property Paths
inferredcites →https://doi.org/10.1145/3035918.3035955openalex-snapshot
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries
inferredcites →https://doi.org/10.1145/3299869.3319882openalex-snapshot
Efficiently Answering Regular Simple Path Queries on Large Labeled Networks
inferredcites →https://doi.org/10.1145/360715.360746openalex-snapshot
A modification of Warshall's algorithm for the transitive closure of binary relations
inferredcites →https://doi.org/10.1145/504311.504290openalex-snapshot
Efficient subtyping tests with PQ-encoding
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/99935.99944openalex-snapshot
A compression technique to materialize transitive closure
inferredcites →https://doi.org/10.14778/1921071.1921074openalex-snapshot
Graph indexing of road networks for shortest path queries with label restrictions
inferredcites →https://doi.org/10.14778/2556549.2556578openalex-snapshot
Simple, fast, and scalable reachability oracle
inferredcites →https://doi.org/10.48550/arxiv.1811.11561openalex-snapshot
Approximate Evaluation of Label-Constrained Reachability Queries
inferredcites →https://doi.org/10.5555/1120060.1712350openalex-snapshot
Lowest common ancestors in trees and directed acyclic graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11704-025-50122-8openalex-snapshot
Reachability-state encoding: bridging tradeoffs between the minimal storage and the fastest query for reachability query
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.1109/icde53745.2022.00193openalex-snapshot
Distributed Set Label-Constrained Reachability Queries over Billion-Scale Graphs
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00013openalex-snapshot
A Reachability Index for Recursive Label-Concatenated Graph Queries
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00194openalex-snapshot
Querying Numeric-Constrained Shortest Distances on Road Networks
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00251openalex-snapshot
Label Constrained Reachability Queries on Time Dependent Graphs
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00133openalex-snapshot
Efficient Meta-Path Constrained Reachability Query on Heterogeneous Information Networks
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/tkde.2022.3161375openalex-snapshot
Reachability Queries with Label and Substructure Constraints on Knowledge Graphs
inferred← citeshttps://doi.org/10.1109/tsc.2025.3547235openalex-snapshot
Efficient Online Computation of Business Process State From Trace Prefixes via N-Gram Indexing
inferred← citeshttps://doi.org/10.1145/3555041.3589408openalex-snapshot
An Overview of Reachability Indexes on Graphs
inferred← citeshttps://doi.org/10.1145/3690624.3709310openalex-snapshot
Weight-Constrained Simple Path Enumeration in Weighted Graph
inferred← citeshttps://doi.org/10.1145/3776737openalex-snapshot
Indexing Techniques for Graph Reachability Queries
inferred← citeshttps://doi.org/10.1515/chem-2022-0149openalex-snapshot
Cyclic connectivity index of bipolar fuzzy incidence graph
inferred← citeshttps://doi.org/10.3390/s23177416openalex-snapshot
Cost-Effective Resources for Computing Approximation Queries in Mobile Cloud Computing Infrastructure
inferred← citeshttps://doi.org/10.4108/eetsis.v9i4.2581openalex-snapshot
Finding Multidimensional Constraint Reachable Paths for Attributed Graphs
inferred← citeshttps://doi.org/10.7717/peerj-cs.2116openalex-snapshot
A wave delay neural network for solving label-constrained shortest route query on time-varying communication 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.