The Sketching Complexity of Graph and Hypergraph Counting.
John KallaugherMichael KapralovEric PricePublished in: CoRR (2018)
Keyphrases
- graph representation
- hypergraph model
- higher order
- adjacency matrix
- polynomial time complexity
- random walk
- graph matching
- computational complexity
- worst case
- search algorithm
- vertex set
- graph theoretic
- high order
- computational cost
- directed graph
- directed acyclic graph
- connected components
- structured data
- generative model
- data sets