Preprint
Sep 2026
On Kernels and Leaves: Searching for Bare and Lush Trees
We study a variation of the classical Maximum (Minimum) Leaf Spanning Tree problem. In many applications, Depth-First Search (DFS) is used to compute a spanning tree of a graph. Such a search tree is constructed by connecting each vertex $v$ with the last vertex the search has visited before $v$ and we call this a last...
Jesse Beisegel, Ekkehard Köhler, R. Scheffler et al.
· 0 citations