1 citations · 1 across the 9 of their papers we have counts for
7 papers · 1 filter
Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
Håvard Bakke Bjerkevik, Joseph Dorfer, Linda Kleist +2
We consider the problem of reconfiguring non-crossing spanning trees on point sets. For a set of points in general position in the plane, the flip graph has a vertex…
Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees
Oswin Aichholzer, Joseph Dorfer, Peter Kramer +2
We study the reconfiguration of plane spanning trees on point sets in the plane in convex position, where a reconfiguration step (flip) replaces one edge with another, yielding aga…
Characterizing and Recognizing Twistedness
Oswin Aichholzer, Alfredo García, Javier Tejel +2
In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills…
Constrained Flips in Plane Spanning Trees
Oswin Aichholzer, Joseph Dorfer, Birgit Vogtenhuber
A flip in a plane spanning tree is the operation of removing one edge from and adding another edge such that the resulting structure is again a plane spanning tree. For tre…
On the geometric -colored crossing number of
Benedikt Hahn, Bettina Klinz, Birgit Vogtenhuber
We study the \emph{geometric -colored crossing number} of complete graphs , which is the smallest number of monochromatic crossings in an…
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…