1 paper
Meike Neuwohner
The Maximum Leaf Spanning Arborescence problem (MLSA) is defined as follows: Given a directed graph G and a vertex r∈V(G) from which every other vertex is reachable, find a…