10 citations · 24 across the 9 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
Fully Dynamic Four-Vertex Subgraph Counting
Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
This paper presents a comprehensive study of algorithms for maintaining the number of all connected four-vertex subgraphs in a dynamic graph. Specifically, our algorithms maintain…
cs.DS2021★ 5 cited
Recent Advances in Fully Dynamic Graph Algorithms
Kathrin Hanauer, Monika Henzinger, Christian Schulz
In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms. However, these theoretical results have received very little attention…