Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes

Gopika Sharma, Arti Pandey, Michael C. Wigal

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…