Results 31 to 40 of about 94,026 (313)
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
Alternative Multiple Spanning Tree Protocol (AMSTP) for Optical Ethernet Backbones [PDF]
, 2004 The availability and affordable cost of Gigabit and 10 Gigabit Ethernet switches has impacted the deployment of metropolitan area networks (MAN) and campus networks.
García-Martínez, Alberto +4 more
core +1 more source
Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
Electronic Journal of Graph Theory and Applications, 2016 This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs $K_m+H_n$ and $K_m+K_{n,p}$, where $H_n$ is a graph with $n$ isolated vertices.
Sung Sik U
doaj +1 more source
Diameter Constrained Fuzzy Minimum Spanning Tree Problem [PDF]
International Journal of Computational Intelligence Systems, 2013 In this paper, we have studied the constrained version of the fuzzy minimum spanning tree problem. Costs of all the edges are considered as fuzzy numbers.
Sk. Md. Abu Nayeem, Madhumangal Pal
doaj +1 more source
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
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
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
Brain Tumor Segmentation Based on Minimum Spanning Tree
Frontiers in Signal Processing, 2022 In this paper, we propose a minimum spanning tree-based method for segmenting brain tumors. The proposed method performs interactive segmentation based on the minimum spanning tree without tuning parameters.
Simeon Mayala +9 more
doaj +1 more source
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
Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
Sensors, 2021 For wireless sensor networks (WSN) with connection failure uncertainties, traditional minimum spanning trees are no longer a feasible option for selecting routes.
Jianhua Lyu +3 more
doaj +1 more source