3 papers
cs.DS2026
New Oracles and Labeling Schemes for Vertex Cut Queries
Yonggang Jiang, Merav Parter, Asaf Petruschka
We study the succinct representations of vertex cuts by centralized oracles and labeling schemes. For an undirected -vertex graph and integer parameter , t…
cs.DS2025
Minimum -- Cuts with Fewer Cut Queries
Yonggang Jiang, Danupon Nanongkai, Pachara Sawettamalya
We study the problem of computing a minimum -- cut in an unweighted, undirected graph via \emph{cut queries}. In this model, the input graph is accessed through an oracle tha…
cs.DS2025
A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
Hossein Gholizadeh, Yonggang Jiang
In this paper, we discuss the maximum flow problem in the two-party communication model, where two parties, each holding a subset of edges on a common vertex set, aim to compute th…