A heuristic for finding leafy spanning trees

In this research, the LeafyST heuristic was designed to find spanning trees with a high amount of leaves for Gnp random graphs and for random geometric graphs. The LeafyST heuristic uses Kruskal's algorithm in combination with a weight assigning rule for the edges to find leafy spanning trees.