Sharma, G.; Pandey, A.; Wiga, M.C.
(2022-10-21)
For a given graph G, a maximum internal spanning tree of G is a spanning tree of
G with maximum number of internal vertices. The Maximum Internal Spanning
Tree (MIST) problem is to find a maximum internal spanning tree ...