Spanning Trees with Many Leaves in Regular Bipartite Graphs

@inproceedings{Fusco2007SpanningTW,
title={Spanning Trees with Many Leaves in Regular Bipartite Graphs},
author={Emanuele G. Fusco and Angelo Monti},
booktitle={ISAAC},
year={2007}
}

Given a d-regular bipartite graph Gd, whose nodes are divided in black nodes and white nodes according to the partition, we consider the problem of computing the spanning tree of Gd with the maximum number of black leaves. We prove that the problem is NP hard for any fixed d ≥ 4 and we present a simple greedy algorithm that gives a constant approximation ratio for the problem. More precisely our algorithm can be used to get in linear time an approximation ratio of 2 − 2/(d − 1) for d ≥ 4. When… CONTINUE READING