8 citations · 17 across the 9 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
On Kernels and Leaves: Searching for Bare and Lush Trees
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler +1
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. Su…
cs.DS2026
Breadth-First Search Trees with Many or Few Leaves
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler +1
The Maximum (Minimum) Leaf Spanning Tree problem asks for a spanning tree with the largest (smallest) number of leaves. As spanning trees are often computed using graph search algo…