1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
cs.DB2025
An experimental comparison of tree-data structures for connectivity queries on fully-dynamic undirected graphs (Extended Version)
Qing Chen, Michael H. Böhlen, Sven Helmer
During the past decades significant efforts have been made to propose data structures for answering connectivity queries on fully dynamic graphs, i.e., graphs with frequent inserti…
cs.DB2015★ 1 cited
On Summarizing Graph Streams
Nan Tang, Qing Chen, Prasenjit Mitra
Graph streams, which refer to the graph with edges being updated sequentially in a form of a stream, have wide applications such as cyber security, social networks and transportati…