On the public citation graph
Scalable dynamic graph summarization
0 signed · 24 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/3-540-44503-x_27openalex-snapshot
On the Surprising Behavior of Distance Metrics in High Dimensional Space
inferredcites →https://doi.org/10.1016/b978-012722442-8/50016-1openalex-snapshot
A Framework for Clustering Evolving Data Streams
inferredcites →https://doi.org/10.1109/icdm.2014.56openalex-snapshot
Graph Summarization with Quality Guarantees
inferredcites →https://doi.org/10.1137/1.9781611972801.40openalex-snapshot
GraSS: Graph Structure Summarization
inferredcites →https://doi.org/10.1145/1376616.1376661openalex-snapshot
Graph summarization with bounded error
inferredcites →https://doi.org/10.1145/1376616.1376675openalex-snapshot
Efficient aggregation for graph summarization
inferredcites →https://doi.org/10.1145/1835804.1835873openalex-snapshot
Neighbor query friendly compression of social networks
inferredcites →https://doi.org/10.1145/2020408.2020566openalex-snapshot
Compression of weighted graphs
inferredcites →https://doi.org/10.1145/2213836.2213855openalex-snapshot
Query preserving graph compression
inferredcites →https://doi.org/10.1145/2661829.2661862openalex-snapshot
Distributed Graph Summarization
inferredcites →https://doi.org/10.2197/ipsjjip.20.77openalex-snapshot
Approximate Homogeneous Graph Summarization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10618-018-0583-9openalex-snapshot
Dynamic graph summarization: a tensor decomposition approach
inferred← citeshttps://doi.org/10.1007/s13278-017-0443-4openalex-snapshot
Toward query-friendly compression of rapid graph streams
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.114921openalex-snapshot
Distributed aggregation-based attributed graph summarization for summary-based approximate attributed graph queries
inferred← citeshttps://doi.org/10.1109/icccbda49378.2020.9095755openalex-snapshot
Aggregation-Based Attributed Graph Summarization
inferred← citeshttps://doi.org/10.1109/tkde.2018.2884471openalex-snapshot
Scalable Dynamic Graph Summarization
inferred← citeshttps://doi.org/10.1145/3651619openalex-snapshot
SsAG : Summarization and Sparsification of Attributed Graphs
inferred← citeshttps://doi.org/10.14778/3137765.3137825openalex-snapshot
Summarizing static and dynamic big graphs
inferred← citeshttps://doi.org/10.32657/10356/137863openalex-snapshot
Querying and mining complex graphs : uncertainty and multi-relations
inferred← citeshttps://doi.org/10.48550/arxiv.1806.01799openalex-snapshot
Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations
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.