Sabbir Ahmed
(Institute of Information and Communication Technology (IICT), 2012-03)
This thesis presents an algorithm for solving the maximum leaf spanning tree problem on a bipartite graph with maximum degree three. The maximum leaf spanning tree of a graph G is a spanning tree where the number of leaves ...