Results 11 to 20 of about 128,042 (286)
Information and Telecommunication Sciences, 2023 Background. Whereas in many tasks of designing efficient telecommunication networks, the number of network nodes is limited, the initial choice of nodes is wider.
Вадим Романюк
doaj +1 more source
Degree-Constrained k-Minimum Spanning Tree Problem
Complexity, 2020 Let GV,E be a simple undirected complete graph with vertex and edge sets V and E, respectively. In this paper, we consider the degree-constrained k-minimum spanning tree (DCkMST) problem which consists of finding a minimum cost subtree of G formed with ...
Pablo Adasme, Ali Dehghan Firoozabadi
doaj +1 more source
The degree constrained k-cardinality minimum spanning tree problem: a lexi-search algorithm [PDF]
Decision Science Letters, 2018 This paper deals with the degree constrained k-cardinality minimum spanning tree (k-MSTPD) problem defined on a connected, edge weighted and undirected graph.
Thenepalle Jayanth Kumar +1 more
doaj +1 more source
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees [PDF]
, 2014 A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges.
Narayanaswamy, N. S., Ramakrishna, G.
core +1 more source
Extensions of the minimum labelling spanning tree problem
Journal of Telecommunications and Information Technology, 2006 In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic
Raffaele Cerulli +2 more
doaj +1 more source
Variable neighbourhood search for the minimum labelling Steiner tree problem [PDF]
, 2009 We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, an NP-hard graph problem related to the minimum labelling spanning tree problem.
Consoli, S +3 more
core +1 more source
Algorithms for the minimum spanning tree problem with resource allocation
Operations Research Perspectives, 2016 We formulate the minimum spanning tree problem with resource allocation (MSTRA) in two ways, as discrete and continuous optimization problems (d-MSTRA/c-MSTRA), prove these to be NP-hard, and present algorithms to solve these problems to optimality.
Seiji Kataoka, Takeo Yamada
doaj +1 more source
The Minimum Spanning Tree Problem on networks with Neutrosophic numbers [PDF]
Neutrosophic Sets and SystemsThe minimum spanning tree problem (MSTP) revolves around creating a spanning tree (ST) within a graph/network that incurs the least cost compared to all other potential STs.
Kalyan Adhikary +2 more
doaj +1 more source
Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem [PDF]
, 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.
Avis +28 more
core +1 more source
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
Моделирование и анализ информационных систем, 2021 In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of k linked edges, which connect 2 or (k +
Alexander Valeryevich Smirnov
doaj +1 more source