3 citations · 3 across the 4 of their papers we have counts for
7 papers
On the expansion of Hanoi graphs
David Eppstein, Daniel Frishberg, William Maxwell
The famous Tower of Hanoi puzzle involves moving discs of distinct sizes from one of pegs (traditionally ) to another of the pegs, subject to the constraints tha…
An Incremental Span-Program-Based Algorithm and the Fine Print of Quantum Topological Data Analysis
Mitchell Black, William Maxwell, Amir Nayyeri
We introduce a new quantum algorithm for computing the Betti numbers of a simplicial complex. In contrast to previous quantum algorithms that work by estimating the eigenvalues of…
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…
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…
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…
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…
Classification of Minimal Separating Sets in Low Genus Surfaces
J. J. P. Veerman, William J. Maxwell, Victor Rielly +1
Consider a surface and let . If is not connected, then we say \emph{separates} , and we refer to as a \emph{separating set} of . If …