Results 91 to 100 of about 128,039 (188)
The Directed Minimum-Degree Spanning Tree Problem [PDF]
, 2001 Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V. The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is the smallest among all such spanning trees. The problem is known to be NP-hard. A quasi-polynomial time approximation algorithm for this problem is presented.
Radha Krishnan, Balaji Raghavachari
openaire +1 more source
Degree-Constrained Minimum Spanning Hierarchies in Graphs
AlgorithmsThe minimum spanning tree problem in graphs under budget-type degree constraints (DCMST) is a well-known NP-hard problem. Spanning trees do not always exist, and the optimum can not be approximated within a constant factor.
Miklos Molnar
doaj +1 more source
On calculation of the stability radius for a minimum spanning tree
Журнал Белорусского государственного университета: Математика, информатика, 2017 We consider a minimum spanning tree problem in the situation where weights of edges are exposed to independent perturbations. We study a quantitative characteristic of stability for a given optimal solutions of the problem.
Yauheni D. Zhyvitsa, Kiril G. Kuzmin
doaj
Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems [PDF]
The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network ...
Ghosh, Diptesh
core
CLEI Electronic JournalThe degree-constrained minimum spanning tree problem (DCMST) is an NP-hard optimization problem defined on connected weighted graphs. It consists of computing a minimum-cost spanning tree of the graph whose nodes have degrees smaller or equal to a ...
José Flavio Lopes +1 more
doaj +1 more source
Exact algorithm for the problem of the minimum complete spanning tree of a divisible multiple graph
Моделирование и анализ информационных системWe study undirected multiple graphs of any natural multiplicity $k > 1$. There are edges of three types: ordinary edges, multiple edges, and multi-edges.
Alexander V. Smirnov
doaj +1 more source
Digital Zone: Jurnal Teknologi Informasi dan KomunikasiSolving Fuzzy Minimum Spanning Tree (FFMST) and Fuzzy Tsukamoto using modified Prim Algorithm for Undirected Graphs and modified Optimal Branching Algorithm for Directed Graphs in FFN environment.
Desli de Haas +2 more
doaj +1 more source
Rough Fuzzy Quadratic Minimum Spanning Tree Problem
, 2017 A quadratic minimum spanning tree (QMST) problem is to determine a minimum spanning tree of a connected graph having edges which are associated with linear and quadratic weights. The linear weights are the edge costs which are associated with every edge whereas the quadratic weights are the interaction costs between a pair of edges of the graph.
Majumder, Saibal +2 more
openaire +2 more sources
On the Shapley value of a minimum cost spanning tree problem [PDF]
We associate an optimistic coalitional game with each minimum cost spanning tree problem. We define the worth of a coalition as the cost of connection assuming that the rest of the agents are already connected.
Gustavo Bergantiños, Juan Vidal-Puga
core
Weight-Constrained Minimum Spanning Tree Problem [PDF]
, 2007 In an undirected graph G we associate costs and weights to each edge. The weight-constrained minimum spanning tree problem is to find a spanning tree of total edge weight at most a given value W and minimum total costs under this restriction. In this thesis a literature overview on this NP-hard problem, theoretical properties concerning the convex hull
openaire +1 more source