Angelo Monti

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

2016 · IRIS Research product catalog (Sapienza University of Rome)

A locally connected spanning tree (LCST) T of a graph G is a spanning tree of G such that for each node its neighborhood in T induces a connected subgraph in G.The problem of determining …