39 citations · 117 across the 39 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Matching through Embedding in Dense Graphs
Nitish K. Panigrahy, Prithwish Basu, Don Towsley
Finding optimal matchings in dense graphs is of general interest and of particular importance in social, transportation and biological networks. While developing optimal solutions…
cs.DS2018
Utilizing Dynamic Properties of Sharing Bits and Registers to Estimate User Cardinalities over Time
Pinghui Wang, Peng Jia, Xiangliang Zhang +3
Online monitoring user cardinalities (or degrees) in graph streams is fundamental for many applications. For example in a bipartite graph representing user-website visiting activit…