1 citations · 1 across the 10 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
Multivariate Exploration of Metric Dilation
Aritra Banik, Fedor V. Fomin, Petr A. Golovach +3
Let be a weighted graph embedded in a metric space . The vertices of correspond to the points in , with the weight of each edge being the distance $d_M…
cs.DM2024
Cuts in Graphs with Matroid Constraints
Aritra Banik, Fedor V. Fomin, Petr A. Golovach +3
{\sc Vertex -Cut} and {\sc Vertex Multiway Cut} are two fundamental graph separation problems in algorithmic graph theory. We study matroidal generalizations of these probl…