Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Generalized max-flows and min-cuts in simplicial complexes
William Maxwell, Amir Nayyeri
We consider high dimensional variants of the maximum flow and minimum cut problems in the setting of simplicial complexes and provide both algorithmic and hardness results. By view…
cs.DS2020
Low-stretch spanning trees of graphs with bounded width
Glencora Borradaile, Erin Wolf Chambers, David Eppstein +2
We study the problem of low-stretch spanning trees in graphs of bounded width: bandwidth, cutwidth, and treewidth. We show that any simple connected graph with a linear arrange…