On the public citation graph

Adapting Prime Number Labeling Scheme for Directed Acyclic Graphs

0 signed · 27 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/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1016/j.websem.2003.11.001openalex-snapshot
Optimizing taxonomic semantic web queries using labeling schemes
inferredcites →https://doi.org/10.1093/comjnl/28.1.5openalex-snapshot
Labelling and Implicit Routing in Networks
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.1137/s0097539702403098openalex-snapshot
Reachability and Distance Queries via 2-Hop Labels
inferredcites →https://doi.org/10.1145/42190.46167openalex-snapshot
Type extensions

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-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-02121-3_32openalex-snapshot
How to Trace and Revise Identities
inferred← citeshttps://doi.org/10.1007/s11390-009-9265-9openalex-snapshot
System Π: A Native RDF Repository Based on the Hypergraph Representation for RDF Data Model
inferred← citeshttps://doi.org/10.1016/j.eij.2012.10.002openalex-snapshot
Efficient evaluation of reachability query for directed acyclic XML graph based on a prime number labelling schema
inferred← citeshttps://doi.org/10.1109/access.2020.3007592openalex-snapshot
Efficient Access Control of Large Scale RDF Data Using Prefix-Based Labeling
inferred← citeshttps://doi.org/10.1109/icde.2011.5767893openalex-snapshot
Selectivity estimation of twig queries on cyclic graphs
inferred← citeshttps://doi.org/10.1109/icdew.2008.4498361openalex-snapshot
An RDF triple based access authorization specification considering subsumption relationships
inferred← citeshttps://doi.org/10.1109/icitcs.2016.7740360openalex-snapshot
Parallel Prime Number Labeling of Large XML Data Using MapReduce
inferred← citeshttps://doi.org/10.1109/icsc.2009.19openalex-snapshot
Using a Formal Language Constructs for Software Model Evolution
inferred← citeshttps://doi.org/10.1109/iri.2011.6009548openalex-snapshot
E-CAL: A formal language for software model evolution
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/waim.2008.90openalex-snapshot
System II: A Native RDF Repository Based on the Hypergraph Representation for RDF Data Model
inferred← citeshttps://doi.org/10.1145/1367497.1367611openalex-snapshot
On incremental maintenance of 2-hop labeling of graphs
inferred← citeshttps://doi.org/10.1145/1367497.1367643openalex-snapshot
System II
inferred← citeshttps://doi.org/10.1145/3221269.3232012openalex-snapshot
Declarative cartography under fine-grained access control
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.41openalex-snapshot
RDFacl: A Secure Access Control Model Based on RDF Triple
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.1889openalex-snapshot
Decomposition Optimization for Minimizing Label Overflow in Prime Number Graph Labeling
inferred← citeshttps://doi.org/10.22215/etd/2007-08215openalex-snapshot
Automating software evolution: towards using constraints with action for model evolution
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.9708/jksci.2011.16.4.169openalex-snapshot
A Prime Number Labeling Based on Tree Decomposition for Dynamic XML Data Management
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.