3 citations · 8 across the 9 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
Julia Chuzhoy, Ron Mosenzon, Ohad Trabelsi
We study the directed global minimum vertex-cut problem: given a directed vertex-weighted graph , compute a vertex-cut in of minimum value, which is defined to be…
cs.DS2025
Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut
Julia Chuzhoy, Ohad Trabelsi
We consider the Global Minimum Vertex-Cut problem: given an undirected vertex-weighted graph , compute a minimum-weight subset of its vertices whose removal disconnects . The…