|
|
|
|
|
Rakesh Kawatra
In this paper we present a new heuristic procedure to solve the degree constrained minimal spanning tree problem. This procedure uses Lagrangian relaxation of the integer programming formulation of the problem to get a lower bound for the optimal objecti...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mansooreh Kazemilari and Ali Mohamadi
Correlation network based on similarity is the common approach in financial network analyses where the Minimal Spanning Tree (MST) is used to filter the important information contained in the network. In this paper, by considering a distance matrix based...
ver más
|
|
|
|
|
|
|
|
|
|
|
Geneviève Simonet and Anne Berry
The atom graph of a connected graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all its atom trees. A graph G is an atom graph if there is a graph whose atom g...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yulia Terentyeva
Pág. 23 - 27
The article discusses the issue of restoring the connectivity of a communication network in the case of its fragmentation with a certain criterion of optimality. As an optimality criterion, the total length of the edges being completed is taken, the weig...
ver más
|
|
|
|
|
|