Problem 11: Counting Triangles

From Open Problems in Sublinear Algorithms
Revision as of 05:33, 8 November 2012 by Krzysztof Onak (talk | contribs) (1 revision)
Jump to: navigation, search
Proposed by Stefano Leonardi
Source Kanpur 2006
Short link

Given a stream in which edges are inserted and deleted to/from an unweighted, undirected graph, how well can we count triangles and other sub-graphs? Most of the previous work has focussed on the case of insertions [BarYossefKS-02,JowhariG-05,BuriolFLMS-06] although it appears that one of the algorithms in [JowhariG-05] may work when edges can be deleted. Is it possible to match the insert-only bounds when edges are inserted and deleted?