1 citations · 2 across the 3 of their papers we have counts for
3 papers · 1 filter
Flipping Non-Crossing Spanning Trees
Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt +1
For a set of points in general position in the plane, the flip graph has a vertex for each non-crossing spanning tree on and an edge between any two spanning tre…
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
Aaron T. Becker, Sándor P. Fekete, Li Huang +5
We investigate algorithmic approaches for targeted drug delivery in a complex, maze-like environment, such as a vascular system. The basic scenario is given by a large swarm of mic…
On the Connectivity of the Flip Graph of Plane Spanning Paths
Linda Kleist, Peter Kramer, Christian Rieck
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. T…