On the public citation graph

Querying massive graph data: A compress and search approach

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.1007/978-1-4419-6045-0_4openalex-snapshot
Query Language and Access Methods for Graph Databases
inferredcites →https://doi.org/10.1007/978-3-540-27810-8_17openalex-snapshot
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
inferredcites →https://doi.org/10.1007/bf02020961openalex-snapshot
Transitiv orientierbare Graphen
inferredcites →https://doi.org/10.1007/s10115-013-0693-zopenalex-snapshot
Defining and evaluating network communities based on ground-truth
inferredcites →https://doi.org/10.1007/s10586-016-0712-4openalex-snapshot
SmallClient for big data: an indexing framework towards fast data retrieval
inferredcites →https://doi.org/10.1007/s10618-016-0451-4openalex-snapshot
An efficient exact algorithm for triangle listing in large graphs
inferredcites →https://doi.org/10.1007/s11390-014-1473-2openalex-snapshot
Querying Big Data: Bridging Theory and Practice
inferredcites →https://doi.org/10.1016/b978-012722442-8/50021-5openalex-snapshot
Path Queries on Compressed XML
inferredcites →https://doi.org/10.1016/j.cosrev.2010.01.001openalex-snapshot
A survey of the algorithmic aspects of modular decomposition
inferredcites →https://doi.org/10.1016/j.patcog.2014.03.014openalex-snapshot
A distance measure for large graphs based on prime graphs
inferredcites →https://doi.org/10.1080/15427951.2009.10129177openalex-snapshot
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
inferredcites →https://doi.org/10.1109/dcc.1991openalex-snapshot
[1991] Proceedings. Data Compression Conference
inferredcites →https://doi.org/10.1109/dcc.2001.917151openalex-snapshot
Towards compressing Web graphs
inferredcites →https://doi.org/10.1109/dcc.2002.999950openalex-snapshot
The Link Database: fast access to graphs of the Web
inferredcites →https://doi.org/10.1109/icde.2012.91openalex-snapshot
Efficient Graph Similarity Joins with Edit Distance Constraints
inferredcites →https://doi.org/10.1109/tpami.2004.75openalex-snapshot
A (sub)graph isomorphism algorithm for matching large graphs
inferredcites →https://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferredcites →https://doi.org/10.1142/s0218001404003228openalex-snapshot
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
inferredcites →https://doi.org/10.1145/1017466.1017467openalex-snapshot
Data structure diagrams
inferredcites →https://doi.org/10.1145/1081870openalex-snapshot
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
inferredcites →https://doi.org/10.1145/1081870.1081893openalex-snapshot
Graphs over time
inferredcites →https://doi.org/10.1145/1247480openalex-snapshot
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
inferredcites →https://doi.org/10.1145/1376616.1376660openalex-snapshot
Graphs-at-a-time
inferredcites →https://doi.org/10.1145/1516360openalex-snapshot
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
inferredcites →https://doi.org/10.1145/1516360.1516384openalex-snapshot
GADDI
inferredcites →https://doi.org/10.1145/1526709openalex-snapshot
Proceedings of the 18th international conference on World wide web
inferredcites →https://doi.org/10.1145/1772690.1772756openalex-snapshot
Predicting positive and negative links in online social networks
inferredcites →https://doi.org/10.1145/1835804.1835873openalex-snapshot
Neighbor query friendly compression of social networks
inferredcites →https://doi.org/10.1145/1989323openalex-snapshot
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
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/2020408openalex-snapshot
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
inferredcites →https://doi.org/10.1145/2213836.2213855openalex-snapshot
Query preserving graph compression
inferredcites →https://doi.org/10.1145/2463676.2465300openalex-snapshot
Turbo iso
inferredcites →https://doi.org/10.1145/2588555openalex-snapshot
Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data
inferredcites →https://doi.org/10.1145/321864.321866openalex-snapshot
An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot
An Algorithm for Subgraph Isomorphism
inferredcites →https://doi.org/10.1145/543613openalex-snapshot
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
inferredcites →https://doi.org/10.1145/543613.543620openalex-snapshot
Algorithmics and applications of tree and graph searching
inferredcites →https://doi.org/10.1145/988672openalex-snapshot
Proceedings of the 13th international conference on World Wide Web
inferredcites →https://doi.org/10.1145/988672.988752openalex-snapshot
The webgraph framework I
inferredcites →https://doi.org/10.1184/r1/6605999openalex-snapshot
GraphChi: Large-Scale Graph Computation on Just a PC
inferredcites →https://doi.org/10.1186/1471-2105-14-s7-s13openalex-snapshot
A subgraph isomorphism algorithm and its application to biochemical data
inferredcites →https://doi.org/10.14778/1453856.1453899openalex-snapshot
Taming verification hardness
inferredcites →https://doi.org/10.14778/1687627.1687711openalex-snapshot
Mining graph patterns efficiently via randomized summaries
inferredcites →https://doi.org/10.14778/1920841.1920887openalex-snapshot
On graph query optimization in large networks
inferredcites →https://doi.org/10.14778/2535568.2448946openalex-snapshot
An in-depth comparison of subgraph isomorphism algorithms in graph databases
inferredcites →https://doi.org/10.14778/2735479.2735493openalex-snapshot
Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs
inferredcites →https://doi.org/10.2172/895418openalex-snapshot
The State of the Art in Graph-Based Pattern Matching
inferredcites →https://doi.org/10.46298/dmtcs.298openalex-snapshot
Graph Decompositions and Factorizing Permutations
inferredcites →https://doi.org/10.48550/arxiv.1502.07576openalex-snapshot
Comparison Issues in Large Graphs: State of the Art and Future Directions
inferredcites →https://doi.org/10.5220/0005875002040213openalex-snapshot
Subgraph Isomorphism Search in Massive Graph Databases
inferredcites →https://doi.org/10.5860/choice.38-2200openalex-snapshot
Graphs and applications: an introductory approach

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.4432openalex-snapshot
An efficient iterative graph data processing framework based on bulk synchronous parallel model
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_5openalex-snapshot
Approximating Modular Decomposition Is Hard
inferred← citeshttps://doi.org/10.1016/bs.adcom.2021.10.010openalex-snapshot
The major challenges of big graph and their solutions: A review
inferred← citeshttps://doi.org/10.1016/j.compind.2024.104207openalex-snapshot
BRepQL: Query language for searching topological elements in B-rep models
inferred← citeshttps://doi.org/10.1016/j.future.2017.09.013openalex-snapshot
Internet of Things, Big Data and Complex Information Systems: Challenges, solutions and outputs from IoTBD 2016, COMPLEXIS 2016 and CLOSER 2016 selected papers and CLOSER 2015 keynote
inferred← citeshttps://doi.org/10.1016/j.future.2017.09.020openalex-snapshot
Next generation cloud computing: New trends and research directions
inferred← citeshttps://doi.org/10.1016/j.future.2018.08.017openalex-snapshot
A multistage protocol for aggregated queries in distributed cloud databases with privacy protection
inferred← citeshttps://doi.org/10.1016/j.future.2025.107747openalex-snapshot
Accelerating complex graph queries by summary-based hybrid partitioning for discovering vulnerabilities of distribution equipment
inferred← citeshttps://doi.org/10.1016/j.ins.2019.01.036openalex-snapshot
Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
inferred← citeshttps://doi.org/10.1016/j.jksuci.2023.101694openalex-snapshot
Enhanced subgraph matching for large graphs using candidate region-based decomposition and ordering
inferred← citeshttps://doi.org/10.1109/access.2019.2926753openalex-snapshot
Parallel Heuristics for Balanced Graph Partitioning Based on Richness of Implicit Knowledge
inferred← citeshttps://doi.org/10.1109/access.2021.3073494openalex-snapshot
An Efficient Subgraph Isomorphism Solver for Large Graphs
inferred← citeshttps://doi.org/10.1109/comsnets.2019.8711459openalex-snapshot
SubISO: A Scalable and Novel Approach for Subgraph Isomorphism Search in Large Graph
inferred← citeshttps://doi.org/10.1109/csudet47057.2019.9214710openalex-snapshot
GOOSE: An Object-oriented Search Algorithm with Graph-based Database
inferred← citeshttps://doi.org/10.1137/21m1443534openalex-snapshot
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
inferred← citeshttps://doi.org/10.1145/3278681.3278696openalex-snapshot
Towards a taxonomy of subgraph isomorphism algorithms
inferred← citeshttps://doi.org/10.1145/3391274.3393638openalex-snapshot
QSGG
inferred← citeshttps://doi.org/10.1145/3786788openalex-snapshot
CGS: Configurable Graph Summarization with Bounded Neighborhood Loss and Query Support
inferred← citeshttps://doi.org/10.1155/2021/9274429openalex-snapshot
Supergraph Topology Feature Index for Personalized Interesting Subgraph Query in Large Labeled Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1703.05547openalex-snapshot
Compact Neighborhood Index for Subgraph Queries in Massive Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1707.07452openalex-snapshot
Next Generation Cloud Computing: New Trends and Research Directions
inferred← citeshttps://doi.org/10.48550/arxiv.1806.01799openalex-snapshot
Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations
inferred← citeshttps://doi.org/10.48550/arxiv.2001.04760openalex-snapshot
Simulation computation in grammar-compressed graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2101.08881openalex-snapshot
(α, β)-Modules in Graphs
inferred← citeshttps://doi.org/10.70675/4436eb34zd9d8z4df2zb413zaa402e87331copenalex-snapshot
Subgraph Isomorphism Search In Massive Graph Data
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.