Counting Triangles under Updates in Worst-Case Optimal Time.

Ahmet Kara Hung Q. Ngo Milos Nikolic Dan Olteanu Haozhe Zhang

Published in: CoRR (2018)

Keyphrases

worst case
upper bound
average case
lower bound
greedy algorithm
approximation algorithms
error bounds
np hard
worst case analysis
neural network
space complexity
real time
data structure
optimal solution
real world
optimal design
data sets
running times