Results 31 to 40 of about 3,689,343 (292)

The spanning k-trees, perfect matchings and spectral radius of graphs [PDF]

Linear and multilinear algebra, 2021
A k-tree is a spanning tree in which every vertex has degree at most k. In this paper, we provide a sufficient condition for the existence of a k-tree in a connected graph with fixed order in terms of the adjacency spectral radius and the signless ...
Dan-Dan Fan, S. Goryainov, Xueyi Huang, Hui-Qiu Lin   +3 more
semanticscholar   +1 more source

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, Azcorra Saloña, Arturo, Azcorra, Arturo, Ibáñez, Guillermo, Ibáñez Fernández, Guillermo Agustín, A. Garcia, G. Ibanez, A. Azcorra   +7 more
core   +2 more sources

MENCARI MINIMUM SPANNING TREE DENGAN KONSTREN

Jurnal Matematika UNAND, 2019
Misalkan G = (V, E) adalah graf tak berarah terhubung yang bukan tree, berarti di G terdapat cycle. Dengan cyclic interchange maka diperoleh subgraf T yang tidak memuat cycle. Subgraf T inilah yang dinamakan dengan spanning tree.
Miftahul Jannah, Narwen Narwen, Bukti Ginting   +2 more
doaj   +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

Determining hop-constrained spanning trees with repetitive heuristics

Journal of Telecommunications and Information Technology, 2023
The hop-constrained minimum spanning tree problem is the problem of determining a rooted spanning tree of minimum cost in which each path from the root node to any other node contains at most H hops or edges.
Manuela Fernandes, Luis Gouveia, Stefan Voß   +2 more
doaj   +1 more source

PRUNING MINIMUM SPANNING TREES AND CUTTING LONGEST EDGES TO CONNECT A GIVEN NUMBER OF NODES BY MINIMIZING TOTAL EDGE LENGTH

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

Learning to Compose Dynamic Tree Structures for Visual Contexts [PDF]

Computer Vision and Pattern Recognition, 2018
We propose to compose dynamic tree structures that place the objects in an image into a visual context, helping visual reasoning tasks such as scene graph generation and visual Q&A.
Kai-Hua Tang, Hanwang Zhang, Baoyuan Wu, Wenhan Luo, W. Liu   +4 more
semanticscholar   +1 more source

Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem [PDF]

, 2009
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Darby-Dowman, K, Mladenović, N, Consoli, S, Moreno-Pérez, JA, DarbyDowman K, Moreno Perez JA, Consoli S, Mladenovic N   +7 more
core   +1 more source

Visualization of very large high-dimensional data sets as minimum spanning trees [PDF]

Journal of Cheminformatics, 2019
The chemical sciences are producing an unprecedented amount of large, high-dimensional data sets containing chemical structures and associated properties.
Daniel Probst, J. Reymond
semanticscholar   +1 more source