Results 1 to 10 of about 43,946 (309)

Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem

European Journal of Operational Research, 2009
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Sérgio Consoli, Nenad Mladenovic, JOSÉ A Moreno Perez   +2 more
exaly   +2 more sources

DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH

Cybernetics and Systems, 2012
Javad Akbari Torkestani
exaly  

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Journal of the ACM, 2001
Jacob Holm, Mikkel Thorup
exaly  

A Divide-and-Conquer Approach for Minimum Spanning Tree-Based Clustering

IEEE Transactions on Knowledge and Data Engineering, 2009
Xiali Wang, D Mitchell Wilkes
exaly  

Obligation rules for minimum cost spanning tree situations and their monotonicity properties

European Journal of Operational Research, 2006
Stef Tijs, Rodica Branzei, Stefano Moretti   +2 more
exaly  

Fuzzy α-minimum spanning tree problem: definition and solutions

International Journal of General Systems, 2016
Jian Zhou, Ke Wang
exaly  

Minimum spanning tree

Proceedings of the Institution of Electrical Engineers, 1975
I. Cahit, R. Cahit
openaire   +1 more source

An algorithm for inverse minimum spanning tree problem

Optimization Methods and Software, 1997
exaly  

An Algorithm for kth Minimum Spanning Tree

Electronic Notes in Discrete Mathematics, 2016
exaly  

Clustering with a minimum spanning tree of scale-free-like structure

Pattern Recognition Letters, 2005
exaly