Results 41 to 50 of about 954,754 (291)

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   +4 more
core   +2 more sources

Intersection of random spanning trees in complex networks

Applied Network Science, 2023
In their previous work, the authors considered the concept of random spanning tree intersection of complex networks (London and Pluhár, in: Cherifi, Mantegna, Rocha, Cherifi, Micciche (eds) Complex networks and their applications XI, Springer, Cham, 2023)
András London, András Pluhár
doaj   +1 more source

SPANNING TREE PROTOKOL

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

Reconfiguration of non-crossing spanning trees

Journal of Computational Geometry
For a set $P$ of $n$ points in the plane in general position, a non-crossing spanning tree is a spanning tree of the points where every edge is a straight-line segment between a pair of points and no two edges intersect except at a common endpoint.
Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Adam Hesterberg, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno   +10 more
doaj   +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   +3 more
core   +1 more source

Spanning k-ended trees of 3-regular connected graphs

Electronic Journal of Graph Theory and Applications, 2017
A vertex of degree one is called an end-vertex and the set of end-vertices of G is denoted by End(G). For a positive integer k, a tree T be called k-ended tree if $|End(T)| \leq k$. In this paper, we obtain sufficient conditions for spanning k-trees of 3-
Hamed Ghasemian Zoeram, Daniel Yaqubi
doaj   +1 more source

Spanning Trees and Spanners [PDF]

, 2000
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
openaire   +2 more sources

Spanning trees with a bounded number of leaves [PDF]

Opuscula Mathematica, 2017
In 1998, H. Broersma and H. Tuinstra proved that: Given a connected graph \(G\) with \(n\geq 3\) vertices, if \(d(u)+d(v)\geq n-k+1\) for all non-adjacent vertices \(u\) and \(v\) of \(G\) (\(k\geq 1\)), then \(G\) has a spanning tree with at most \(k ...
Junqing Cai, Evelyne Flandrin, Hao Li, Qiang Sun   +3 more
doaj   +1 more source

Spanning Trees with Disjoint Dominating and 2-Dominating Sets

Discussiones Mathematicae Graph Theory, 2022
In this paper, we provide a structural characterization of graphs having a spanning tree with disjoint dominating and 2-dominating sets.
Miotk Mateusz, Żyliński Paweł
doaj   +1 more source

Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis

FEBS Letters, EarlyView.
Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee, Junho Jeong, Chae Yeong Lee, Hyunjoon Cho, Man Hwan Oh, Je Chul Lee, Jee‐Young Lee, Yangmee Kim   +7 more
wiley   +1 more source