6 citations · 13 across the 7 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
Improved Algorithms for Edge Colouring in the W-Streaming Model
Moses Charikar, Paul Liu
In the W-streaming model, an algorithm is given space and must process a large graph of up to edges. In this short note we give two algorithms fo…
cs.SI2020★ 4 cited
A simple bipartite graph projection model for clustering in networks
Austin R. Benson, Paul Liu, Hao Yin
Graph datasets are frequently constructed by a projection of a bipartite graph, where two nodes are connected in the projection if they share a common neighbor in the bipartite gra…
cs.DS2020
A polynomial lower bound on adaptive complexity of submodular maximization
Wenzheng Li, Paul Liu, Jan Vondrak
In large-data applications, it is desirable to design algorithms with a high degree of parallelization. In the context of submodular optimization, adaptive complexity has become a…