Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals.
Georgios AmanatidisPieter KleerPublished in: STACS (2023)
Keyphrases
- random graphs
- sample size
- random sampling
- temporal events
- sampling strategy
- graph matching
- graph theory
- texture synthesis
- frequent subgraph mining
- graph construction
- sampling methods
- graph theoretic
- graph mining
- directed graph
- spanning tree
- graph databases
- graph clustering
- monte carlo
- computer vision
- degree distribution
- data sets