Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time.

Kevin Hua Daniel Li Jaewoo Park Thatchaphol Saranurak

Published in: ICALP (2024)

Keyphrases

minimum length
worst case
directed graph
memory requirements
minimum weight
strongly connected
social networks
website
decision trees
scales linearly
simple polygon