1 paper · 1 filter
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi +2
Given a graph G and two spanning trees T and T′ in G, Spanning Tree Reconfiguration asks whether there is a step-by-step transformation from T to T′ such that all inter…