13 citations · 35 across the 15 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
Planar Graphs: Random Walks and Bipartiteness Testing
Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak +1
We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqr…
cs.DS2014★ 2 cited
Parameterized Streaming Algorithms for Vertex Cover
Rajesh Chitnis, Graham Cormode, MohammadTaghi Hajiaghayi +1
As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as eac…