3 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.DM2018
Minimum Labelling bi-Connectivity
Jose' Andres Moreno Perez, Sergio Consoli
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree pr…
cs.DS2015★ 3 cited
On the Minimum Labelling Spanning bi-Connected Subgraph problem
J. A. Moreno Perez, S. Consoli
We introduce the minimum labelling spanning bi-connected subgraph problem (MLSBP) replacing connectivity by bi-connectivity in the well known minimum labelling spanning tree proble…
cs.OH2015
Towards an intelligent VNS heuristic for the k-labelled spanning forest problem
Sergio Consoli, Josè Andrès Moreno Pèrez, Nenad Mladenovic
In a currently ongoing project, we investigate a new possibility for solving the k-labelled spanning forest (kLSF) problem by an intelligent Variable Neighbourhood Search (Int-VNS)…