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…