Near Uniform Triangle Sampling Over Adjacency List Graph Streams.
Arijit BishnuArijit GhoshGopinath MishraSayantan SenPublished in: CoRR (2024)
Keyphrases
- strongly connected
- graph representation
- directed graph
- uniform sampling
- structured data
- graph structure
- graph based algorithm
- data streams
- graph theoretic
- directed acyclic graph
- monte carlo
- graph theory
- data sets
- weighted graph
- random walk
- real time
- graph databases
- spanning tree
- bipartite graph
- graph construction
- active learning
- reservoir sampling
- frequent subgraph mining
- neural network
- xml documents
- graph search
- stream processing
- graph clustering
- sampling algorithm
- np complete
- graph partitioning
- graph model
- graph mining
- link analysis
- random sampling