A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees.

Tiziana Calamoneri Matteo Dell'Orefice Angelo Monti

Published in: ICTCS (2016)

Keyphrases

spanning tree
minimum cost
minimum spanning tree
computational complexity
root node
minimum spanning trees
minimum weight
lowest cost