University of Twente Student Theses
A heuristic for finding leafy spanning trees
Egberink, J.T. (2023) A heuristic for finding leafy spanning trees.
|
PDF
1MB |
| Abstract: | 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. |
| Item Type: | Essay (Master) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 31 mathematics |
| Programme: | Applied Mathematics MSc (60348) |
| Link to this item: | https://purl.utwente.nl/essays/103866 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page