3 citations · 3 across the 4 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DM2020★ 3 cited
On the treewidth of Hanoi graphs
David Eppstein, Daniel Frishberg, William Maxwell
The objective of the well-known Towers of Hanoi puzzle is to move a set of disks one at a time from one of a set of pegs to another, while keeping the disks sorted on each peg. We…
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…
cs.CG2020
Minimum bounded chains and minimum homologous chains in embedded simplicial complexes
Glencora Borradaile, William Maxwell, Amir Nayyeri
We study two optimization problems on simplicial complexes with homology over , the minimum bounded chain problem: given a -dimensional complex embed…