Parallel edge-based sampling for static and dynamic graphs.
Kartik LakhotiaRajgopal KannanAditya GaurAjitesh SrivastavaViktor K. PrasannaPublished in: CF (2019)
Keyphrases
- random sampling
- parallel implementation
- directed graph
- parallel processing
- graph mining
- frequent subgraph mining
- computer architecture
- graph model
- graph theory
- monte carlo
- active contours
- data structure
- weighted graph
- data sets
- parallel computing
- graph representation
- markov chain monte carlo
- sampling methods
- distributed memory