Counting stars and other small subgraphs in sublinear time

Keyphrases

• Copy number 100%
• Network Motifs 100%
• Sublinear Time 100%
• Small Subgraphs 100%
• 2-path 50%
• Tight 50%
• Sublinear Algorithms 50%
• Polynomial-time Algorithm 50%
• Number of Edges 50%
• Constant Size 50%
• Number of Occurrences 50%
• Motif Counting 50%
• Randomized Algorithms 50%
• 3-path 50%
• Approximation Parameters 50%
• Random Structure 50%
• Higher Moments 50%
• Graphlets 50%
• Query Complexity 50%
• Number of Triangles 50%

Mathematics

• Edge 100%
• Probability Theory 100%
• Triangle 100%
• Polynomial Time 100%
• Running Time 100%
• Variance 100%
• Query Complexity 100%

Computer Science

• Subgraphs 100%
• Approximation (Algorithm) 33%
• Efficient Algorithm 33%
• polynomial-time algorithm 33%
• Constant Probability 33%