Counting triangles under updates in worst-case optimal time
We consider the problem of incrementally maintaining the triangle count query under single-tuple updates to the input relations. We introduce an approach that exhibits a space-time tradeoff such that the space-time product is quadratic in the size of the input database and the update time can be as...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference item |
| Published: |
Schloss Dagstuhl
2019
|