Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams.
Suman K. BeraAmit ChakrabartiPublished in: STACS (2017)
Keyphrases
- upper bound
- lower bound
- graph mining
- graph databases
- substructure discovery
- graph data
- structured data
- equivalence classes
- graph structure
- data sets
- massive graphs
- upper and lower bounds
- data streams
- data structure
- real time
- graph theory
- search space
- directed graph
- connected components
- space time
- graph model
- random walk
- lower and upper bounds
- structural patterns
- spectral decomposition
- learning algorithm