On approximating the number of k-cliques in sublinear time

Keyphrases

• Query Complexity 100%
• Sublinear Time 100%
• Triangle Counting 100%
• High Probability 50%
• Amortization 50%
• General Graphs 50%
• Number of Vertices 50%
• Neighbor Query 50%
• Number of Edges 50%
• Algorithm Complexity 50%
• Query Model 50%
• Random Structure 50%
• Structure Algorithm 50%
• Equal Probability 50%
• General Algorithm 50%
• Large Cliques 50%
• Eden 50%
• Edge Counting 50%

Mathematics

• Clique 100%
• Probability Theory 50%
• Edge 50%
• Query Complexity 50%
• Triangle 50%
• Running Time 25%
• Clique in a Graph 25%

Computer Science

• Approximation (Algorithm) 100%