Results 21 to 30 of about 42,490 (162)
Spanning Trees—Short or Small [PDF]
SIAM Journal on Discrete Mathematics, 1996 We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is the $k$MST problem in which we require a tree of minimum weight spanning at least $k$ nodes in an edge-weighted ...
R. Ravi 0001 +4 more
openaire +3 more sources
Computing phylogenetic trees using topologically related minimum spanning trees
Journal of Graph Algorithms and Applications, 2017 Choi et al.(Choi et al. JMLR, 2011) introduced a minimum spanning tree (MST)-based method called CLGrouping, for constructing tree-structured probabilistic graphical models, a statistical framework that is commonly used for inferring phylogenetic trees ...
Prabhav Kalaghatgi, Thomas Lengauer
doaj +1 more source
Some Characteristics of the Prime Graph of Integer Modulo Groups
InPrime, 2023 The notion of the prime graph of a ring R was first introduced by Bhavanari, Kuncham, and Dasari in 2010. The prime graph of a ring R, denoted by PG(R) is a graph whose vertices are all elements of the ring, where two distinct vertices x and y are ...
Muklas Maulana +3 more
doaj +1 more source
Discrete Mathematics, 1992 The paper studies spanning trees of a cactus. A cactus is a connected graph in which each block is either an edge or a circuit. A rooted graph is an ordered pair \((G,R)\), where \(G\) is a graph and \(R\) is a set of its vertices which contains exactly one vertex from each connected component of \(G\).
Vestergaard, Preben Dahl, Egawa, Y.
openaire +3 more sources
Constructing Independent Spanning Trees on Pancake Networks
IEEE Access, 2020 For any graph G, the set of independent spanning trees (ISTs) is defined as the set of spanning trees in G. All ISTs have the same root, paths from the root to another vertex between distinct trees are vertex-disjoint and edge-disjoint.
Dun-Wei Cheng +2 more
doaj +1 more source
Ramsey Spanning Trees and Their Applications [PDF]
ACM Transactions on Algorithms, 2018 The metric Ramsey problem asks for the largest subset S of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version of Dvoretzky theorem.
Ittai Abraham +4 more
openaire +3 more sources
Construction Algorithm of Completely Independent Spanning Tree in Dragonfly Network [PDF]
Jisuanji kexue, 2022 Dragonfly network,proposed by Kim et al.,is a topology for high-performance computer systems.In dragonfly network,compute nodes are attached to switches,the switches are organized into groups,and the network is organized as a two-level clique.There is a ...
BIAN Qing-rong, CHENG Bao-lei, FAN Jian-xi, PAN Zhi-yong
doaj +1 more source
Chain-Constrained Spanning Trees [PDF]
Mathematical Programming, 2013 We consider the problem of finding a spanning tree satisfying a family of additional constraints. Several settings have been considered previously, the most famous being the problem of finding a spanning tree with degree constraints. Since the problem is hard, the goal is typically to find a spanning tree that violates the constraints as little as ...
Neil Olver, Rico Zenklusen
openaire +6 more sources
Polytechnic and design, 2019 A campus network is an enterprise network that consist of many connected LANs that are all usually in the same geographic area. According to the Network Hierarchy, a campus network has three separated layers - Access Layer, Distribution Layer and Core Layer.
Jelečki, Nikola, Turkalj, Vedran
openaire +1 more source
On Independent [1, 2]-Sets in Trees
Discussiones Mathematicae Graph Theory, 2018 An [1, k]-set S in a graph G is a dominating set such that every vertex not in S has at most k neighbors in it. If the additional requirement that the set must be independent is added, the existence of such sets is not guaranteed in every graph.
Aleid Sahar A. +2 more
doaj +1 more source