On the public citation graph

Continuous Subgraph Pattern Search over Certain and Uncertain Graph Streams

0 signed · 104 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.1006/jagm.1999.1044openalex-snapshot
Faster Subtree Isomorphism
inferredcites →https://doi.org/10.1007/978-1-4615-0005-6openalex-snapshot
Handbook of Massive Data Sets
inferredcites →https://doi.org/10.1007/978-1-4615-0005-6_4openalex-snapshot
Random Evolution in Massive Graphs
inferredcites →https://doi.org/10.1007/978-3-540-87479-9_13openalex-snapshot
Finding Reliable Subgraphs from Large Probabilistic Graphs
inferredcites →https://doi.org/10.1080/1350485032000139006openalex-snapshot
The city as a giant component: a random graph approach to Zipf's law
inferredcites →https://doi.org/10.1093/bioinformatics/btl571openalex-snapshot
SAGA: a subgraph matching tool for biological graphs
inferredcites →https://doi.org/10.1093/nar/30.5.1163openalex-snapshot
Interaction generality, a measurement to assess the reliability of a protein-protein interaction
inferredcites →https://doi.org/10.1109/cvpr.2008.4587500openalex-snapshot
Probabilistic graph and hypergraph matching
inferredcites →https://doi.org/10.1109/icde.2002.994756openalex-snapshot
Keyword searching and browsing in databases using BANKS
inferredcites →https://doi.org/10.1109/icde.2006.37openalex-snapshot
Closure-Tree: An Index Structure for Graph Queries
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.2007.367902openalex-snapshot
GString: A Novel Approach for Efficient Search in Graph Databases
inferredcites →https://doi.org/10.1109/icde.2007.368955openalex-snapshot
TreePi: A Novel Graph Indexing Method
inferredcites →https://doi.org/10.1109/icde.2007.368956openalex-snapshot
Graph Database Indexing Using Structured Graph Decomposition
inferredcites →https://doi.org/10.1109/icde.2007.368967openalex-snapshot
Similarity Match Over High Speed Time-Series Streams
inferredcites →https://doi.org/10.1109/icde.2008.4497505openalex-snapshot
TALE: A Tool for Approximate Large Graph Matching
inferredcites →https://doi.org/10.1109/icde.2009.132openalex-snapshot
Continuous Subgraph Pattern Search over Graph Streams
inferredcites →https://doi.org/10.1109/icdm.2001.989534openalex-snapshot
Frequent subgraph discovery
inferredcites →https://doi.org/10.1109/icdm.2002.1184038openalex-snapshot
gSpan: graph-based substructure pattern mining
inferredcites →https://doi.org/10.1109/sfcs.2001.959927openalex-snapshot
Random evolution in massive graphs
inferredcites →https://doi.org/10.1109/swat.1971.1openalex-snapshot
A n5/2 algorithm for maximum matchings in bipartite
inferredcites →https://doi.org/10.1142/9789812836939_0020openalex-snapshot
IDENTIFYING DYNAMIC NETWORK MODULES WITH TEMPORAL AND SPATIAL CONSTRAINTS
inferredcites →https://doi.org/10.1145/1007568.1007607openalex-snapshot
Graph indexing
inferredcites →https://doi.org/10.1145/1247480.1247516openalex-snapshot
BLINKS
inferredcites →https://doi.org/10.1145/1247480.1247573openalex-snapshot
Fast and practical indexing and querying of very large graphs
inferredcites →https://doi.org/10.1145/1247480.1247574openalex-snapshot
Fg-index
inferredcites →https://doi.org/10.1145/1281192.1281266openalex-snapshot
GraphScope
inferredcites →https://doi.org/10.1145/1281192.1281269openalex-snapshot
A framework for community identification in dynamic social networks
inferredcites →https://doi.org/10.1145/1321440.1321442openalex-snapshot
Management of data with uncertainties
inferredcites →https://doi.org/10.1145/1353343.1353369openalex-snapshot
A novel spectral coding in a large graph database
inferredcites →https://doi.org/10.1145/1376616.1376641openalex-snapshot
Monochromatic and bichromatic reverse skyline search over uncertain databases
inferredcites →https://doi.org/10.1145/1376616.1376660openalex-snapshot
Graphs-at-a-time
inferredcites →https://doi.org/10.1145/1498915.1498916openalex-snapshot
Underground coal mine monitoring with wireless sensor networks
inferredcites →https://doi.org/10.1145/1516360.1516384openalex-snapshot
GADDI
inferredcites →https://doi.org/10.1145/1557019.1557035openalex-snapshot
A viewpoint-based approach for interaction graph analysis
inferredcites →https://doi.org/10.1145/1557019.1557110openalex-snapshot
Constant-factor approximation algorithms for identifying dynamic communities
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.1145/543613.543620openalex-snapshot
Algorithmics and applications of tree and graph searching
inferredcites →https://doi.org/10.1145/564691.564734openalex-snapshot
Continually evaluating similarity-based pattern queries on a streaming time series
inferredcites →https://doi.org/10.1145/602259.602266openalex-snapshot
R-trees
inferredcites →https://doi.org/10.1145/872757.872814openalex-snapshot
An optimal and progressive algorithm for skyline queries
inferredcites →https://doi.org/10.1145/971697.602266openalex-snapshot
R-trees
inferredcites →https://doi.org/10.14778/1453856.1453899openalex-snapshot
Taming verification hardness
inferredcites →https://doi.org/10.7939/r3sx64c5kopenalex-snapshot
The Graph Isomorphism Problem

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-1-4614-7163-9_391-1openalex-snapshot
Stream Querying and Reasoning on Social Data
inferred← citeshttps://doi.org/10.1007/978-3-031-01860-2openalex-snapshot
On Uncertain Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-63579-8_9openalex-snapshot
Time-Constrained Graph Pattern Matching in a Large Temporal Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-31235-9_14openalex-snapshot
Discovery of Top-k Dense Subgraphs in Dynamic Graph Collections
inferred← citeshttps://doi.org/10.1007/978-981-13-7166-0_78openalex-snapshot
Extensible Attribute Similarity Data Mining for Categorical Data Streams in Web Usage Framework
inferred← citeshttps://doi.org/10.1007/s00778-017-0460-yopenalex-snapshot
On efficiently finding reverse k-nearest neighbors over uncertain graphs
inferred← citeshttps://doi.org/10.1007/s00778-023-00795-zopenalex-snapshot
Temporal graph patterns by timed automata
inferred← citeshttps://doi.org/10.1007/s10115-022-01681-wopenalex-snapshot
A survey on mining and analysis of uncertain graphs
inferred← citeshttps://doi.org/10.1007/s10489-017-1005-1openalex-snapshot
A streaming sampling algorithm for social activity networks using fixed structure learning automata
inferred← citeshttps://doi.org/10.1007/s11280-020-00784-0openalex-snapshot
SGPM: a privacy protected approach of time-constrained graph pattern matching in cloud
inferred← citeshttps://doi.org/10.1016/j.datak.2018.09.003openalex-snapshot
INSiGHT: A system to detect violent extremist radicalization trajectories in dynamic graphs
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.08.018openalex-snapshot
An improved association rules mining method
inferred← citeshttps://doi.org/10.1016/j.eswa.2013.07.094openalex-snapshot
Sliding window based weighted maximal frequent pattern mining over data streams
inferred← citeshttps://doi.org/10.1016/j.fss.2021.07.017openalex-snapshot
Effective and efficient aggregation on uncertain graphs
inferred← citeshttps://doi.org/10.1016/j.knosys.2013.10.011openalex-snapshot
Mining maximal frequent patterns by considering weight conditions over data streams
inferred← citeshttps://doi.org/10.1080/00207721.2011.627475openalex-snapshot
Learning naive Bayes classifiers from positive and unlabelled examples with uncertainty
inferred← citeshttps://doi.org/10.1088/1742-6596/1550/3/032125openalex-snapshot
Estimate the number of triangles in real-world graph streams
inferred← citeshttps://doi.org/10.1109/access.2020.2964785openalex-snapshot
Searching Correlated Patterns From Graph Streams
inferred← citeshttps://doi.org/10.1109/dsn58291.2024.00036openalex-snapshot
IPMES: A Tool for Incremental TTP Detection Over the System Audit Event Stream
inferred← citeshttps://doi.org/10.1109/dsn64029.2025.00035openalex-snapshot
IPMES+: Enhancing Incremental TTP Detection with Frequency and Flow Semantics
inferred← citeshttps://doi.org/10.1109/iccsnt.2017.8343695openalex-snapshot
Hasse diagram based algorithm for continuous temporal subgraph query in graph stream
inferred← citeshttps://doi.org/10.1109/icde.2014.6816704openalex-snapshot
Cloud service placement via subgraph matching
inferred← citeshttps://doi.org/10.1109/icde.2014.6816710openalex-snapshot
Subgraph pattern matching over uncertain graphs with identity linkage uncertainty
inferred← citeshttps://doi.org/10.1109/icde.2019.00100openalex-snapshot
Time Constrained Continuous Subgraph Search Over Streaming Graphs
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00119openalex-snapshot
DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/icspcc.2017.8242535openalex-snapshot
A join-cache tree based approach for continuous temporal pattern detection in streaming graph
inferred← citeshttps://doi.org/10.1109/tcss.2019.2938787openalex-snapshot
Finding Emergent Patterns of Behaviors in Dynamic Heterogeneous Social Networks
inferred← citeshttps://doi.org/10.1109/tcyb.2017.2708979openalex-snapshot
Hashing for Adaptive Real-Time Graph Stream Classification With Concept Drifts
inferred← citeshttps://doi.org/10.1109/tkde.2012.235openalex-snapshot
Uncertain One-Class Learning and Concept Summarization Learning on Uncertain Data Streams
inferred← citeshttps://doi.org/10.1109/tkde.2013.108openalex-snapshot
An Efficient Approach for Outlier Detection with Imperfect Data Labels
inferred← citeshttps://doi.org/10.1109/tkde.2020.3035902openalex-snapshot
Space-Efficient Subgraph Search Over Streaming Graph With Timing Order Constraint
inferred← citeshttps://doi.org/10.1109/tpami.2024.3388589openalex-snapshot
Learning to Sketch: A Neural Approach to Item Frequency Estimation in Streaming Data
inferred← citeshttps://doi.org/10.1109/tsc.2023.3333840openalex-snapshot
Fast Subgraph Matching by Dynamic Graph Editing
inferred← citeshttps://doi.org/10.1142/s0218001416500129openalex-snapshot
Approximate Maximal Frequent Pattern Mining with Weight Conditions and Error Tolerance
inferred← citeshttps://doi.org/10.1145/2463676.2463697openalex-snapshot
StreamWorks
inferred← citeshttps://doi.org/10.1145/2489247.2489251openalex-snapshot
Fast search for dynamic multi-relational graphs
inferred← citeshttps://doi.org/10.1145/2541290openalex-snapshot
Efficient Multiview Maintenance under Insertion in Huge Social Networks
inferred← citeshttps://doi.org/10.1145/2588555.2593668openalex-snapshot
The pursuit of a good possible world
inferred← citeshttps://doi.org/10.1145/2601438openalex-snapshot
Network Sampling
inferred← citeshttps://doi.org/10.1145/2602087.2602111openalex-snapshot
Predicting and detecting emerging cyberattack patterns using StreamWorks
inferred← citeshttps://doi.org/10.1145/2623330.2623757openalex-snapshot
Graph sample and hold
inferred← citeshttps://doi.org/10.1145/2933267.2933306openalex-snapshot
Continuous graph pattern matching over knowledge graph streams
inferred← citeshttps://doi.org/10.1145/2949689.2949701openalex-snapshot
SPECTRA
inferred← citeshttps://doi.org/10.1145/3406243openalex-snapshot
An Approach For Concept Drift Detection in a Graph Stream Using Discriminative Subgraphs
inferred← citeshttps://doi.org/10.1145/3769774openalex-snapshot
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings
inferred← citeshttps://doi.org/10.14778/2735496.2735504openalex-snapshot
Event pattern matching over graph streams
inferred← citeshttps://doi.org/10.14778/3457390.3457395openalex-snapshot
Symmetric continuous subgraph matching with bidirectional dynamic programming
inferred← citeshttps://doi.org/10.14778/3523210.3523218openalex-snapshot
An in-depth study of continuous subgraph matching
inferred← citeshttps://doi.org/10.14778/3551793.3551803openalex-snapshot
RapidFlow
inferred← citeshttps://doi.org/10.26483/ijarcs.v9i3.5931openalex-snapshot
CLUSTERING MULTI ATTRIBUTE SIMILARITY INDEX FOR CATEGORICAL DATA STREAMS
inferred← citeshttps://doi.org/10.3390/app13085137openalex-snapshot
Efficient Continuous Subgraph Matching Scheme Based on Trie Indexing for Graph Stream Processing
inferred← citeshttps://doi.org/10.35940/ijrte.b1282.0982s1119openalex-snapshot
Data Summarization based on Multiple Attributes in Unreliable Categorical Data
inferred← citeshttps://doi.org/10.48550/arxiv.1209.2178openalex-snapshot
Continuous Queries for Multi-Relational Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1211.3412openalex-snapshot
Network Sampling: From Static to Streaming Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1306.2459openalex-snapshot
Fast Search for Dynamic Multi-Relational Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1403.3909openalex-snapshot
Graph Sample and Hold: A Framework for Big-Graph Analytics
inferred← citeshttps://doi.org/10.48550/arxiv.1407.3745openalex-snapshot
Query Optimization for Dynamic Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1503.00849openalex-snapshot
A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1605.02174openalex-snapshot
Subgraph Isomorphism in Temporal Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1902.05134openalex-snapshot
Efficient Continuous Multi-Query Processing over Graph Streams
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.