Results 31 to 40 of about 133,936 (292)
1-Skeletons of the Spanning Tree Problems with Additional Constraints
Моделирование и анализ информационных систем, 2015 In this paper, we study polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less than ...
V. A. Bondarenko +2 more
doaj +1 more source
Analyzing of Systemic Risk Contributions of Tehran Stock Exchange Companies by Complexity Approach [PDF]
راهبرد مدیریت مالی, 2022 With the recent extension of markets and increasing financial interactions, institutions are affected by their systemic risk and the systemic risk of other institutions and markets.
Ali Namaki +2 more
doaj +1 more source
Spanning trees without adjacent vertices of degree 2
, 2019 Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that there exist highly connected graphs in which every spanning tree contains vertices of degree 2.
Lyngsie, Kasper Szabo, Merker, Martin
core +1 more source
Evolutionary and Ecological Trees and Networks [PDF]
, 2007 Evolutionary relationships between species are usually represented in phylogenies, i.e. evolutionary trees, which are a type of networks. The terminal nodes of these trees represent species, which are made of individuals and populations among which gene ...
Arnaud-Haond, S. +7 more
core +3 more sources
Degree-constrained minimum spanning tree problem using genetic algorithm [PDF]
2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC), 2012 Computer network technology has been growing explosively and the multicast technology has become a hot Internet research topic. The main goal of multicast routing algorithm is seeking a minimum cost multicast tree in a given network, also known as the Steiner tree problem, which is a classical NP-Complete problem. We measure the multicast capability of
Keke Liu +4 more
openaire +1 more source
Minimum Reload Cost Graph Factors [PDF]
, 2019 The concept of Reload cost in a graph refers to the cost that occurs while traversing a vertex via two of its incident edges. This cost is uniquely determined by the colors of the two edges.
A Celik +17 more
core +2 more sources
Transport, 2023 Using a Macroscopic Fundamental Diagram (MFD) to implement partition control is effective in improving mobility in heterogeneous city networks. As one of the most complex issues in partition control, accurate sub-region partition is critical for control
Heng Ding +4 more
doaj +1 more source
Spanning trees with few branch vertices [PDF]
, 2019 A branch vertex in a tree is a vertex of degree at least three. We prove that, for all $s\geq 1$, every connected graph on $n$ vertices with minimum degree at least $(\frac{1}{s+3}+o(1))n$ contains a spanning tree having at most $s$ branch vertices ...
DeBiasio, Louis, Lo, Allan
core +3 more sources
Distributed Algorithms for Minimum Degree Spanning Trees
, 2018 The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree $T$ for graph $G=(V,E)$ with $n$ vertices, such that the maximum degree $d$ of $T$ is the smallest among all spanning trees of $G$. In this paper, we present two new distributed approximation algorithms for the MDST problem.
Dinitz, Michael +2 more
openaire +2 more sources
The Degree-Constrained Adaptive Algorithm Based on the Data Aggregation Tree
International Journal of Distributed Sensor Networks, 2014 In the PEDAP algorithm, a minimum spanning tree considering the energy consumption is established based on the Kruskal algorithm, and updated every 100 rounds.
Xiaogang Qi +3 more
doaj +1 more source