Results 1 to 10 of about 133,936 (292)
Degree-Constrained k-Minimum Spanning Tree Problem [PDF]
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 +3 more sources
EEG-based minimum spanning tree analysis reveals network disruptions in Alzheimer’s disease spectrum: an observational study [PDF]
Frontiers in Aging NeuroscienceIntroductionAlzheimer’s disease (AD) is characterized by disrupted brain connectivity, but the network changes across disease stages remain poorly understood.
Xing Ye +5 more
doaj +2 more sources
Exploring weighted network backbone extraction: A comparative analysis of structural techniques. [PDF]
PLoS ONEBackbone extraction simplifies complex networks while retaining essential features. It reduces complexity without losing critical structural information.
Ali Yassin +3 more
doaj +2 more sources
Some models for inverse minimum spanning tree problem with uncertain edge weights [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2022 The inverse minimum spanning tree (IMST) problem is an inverse optimization problem in which one makes the least modification to the edge weights of a predetermined spanning tree, to make it the minimum spanning tree with respect to new edge weights ...
Sagarika Biswal, Ganesh Ghorai
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
Spanning trees with small diameters
AKCE International Journal of Graphs and Combinatorics, 2020 A spanning tree with small diameter of a graph has many applications. In this paper we first make the following conjecture and show that the condition is best possible if it is true. If a connected graph satisfies , then has a spanning tree with diameter
Mikio Kano, Hajime Matsumura
doaj +1 more source
Proximity Drawings of High-Degree Trees [PDF]
, 2010 A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree?
Barát J. +5 more
core +1 more source
International Islamic University Malaysia Engineering Journal, 2020 The Minimum Spanning Tree (MST) is one of the famous problems that is used mostly as the backbone in many network design problems. Given a graph G(V,E), where V is the set of vertices and E is the set of edges connecting vertices in V, and for every edge
Wamiliana Wamiliana +4 more
doaj +1 more source
Graph Theory: A Lost Component For Development in Nigeria
Journal of Nigerian Society of Physical Sciences, 2022 Graph theory is one of the neglected branches of mathematics in Nigeria but with the most applications in other fields of research. This article shows the paucity, importance, and necessity of graph theory in the development of Nigeria.
Olayiwola Babarinsa
doaj +1 more source
Low-Degree Spanning Trees of Small Weight [PDF]
, 1996 The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation algorithm ...
Balaji Raghavachari +3 more
core +6 more sources