126 citations · 262 across the 19 of their papers we have counts for
1 paper · 1 filter
Sergio Consoli, Nenad Mladenovic, Jose Andres Moreno-Perez
Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest n…