1 citations · 1 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Sublinear-Time Clustering Oracle for Signed Graphs
Stefan Neumann, Pan Peng
Social networks are often modeled using signed graphs, where vertices correspond to users and edges have a sign that indicates whether an interaction between users was positive or…
cs.DS2016★ 1 cited
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning
Monika Henzinger, Stefan Neumann
During the last 10 years it has become popular to study dynamic graph problems in a emergency planning or sensitivity setting: Instead of considering the general fully dynamic prob…