Results 11 to 20 of about 318,192 (295)
Lower-Stretch Spanning Trees [PDF]
SIAM Journal on Computing, 2005 We prove that every weighted graph contains a spanning tree subgraph of average stretch O((log n log log n)^2). Moreover, we show how to construct such a tree in time O(m log^2 n).
Elkin, Michael +3 more
openaire +2 more sources
Low-Degree Spanning Trees of Small Weight [PDF]
, 1996 The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation algorithm ...
Balaji Raghavachari +3 more
core +6 more sources
UHD Journal of Science and TechnologyThis paper examines the concepts and practical applications of the spanning tree protocol (STP). It also covers per-VLAN spanning tree (PVST), multiple spanning tree (MST), and rapid STP (RSTP). Moreover, practical scenarios are presented to help the reader understand the concepts and implementations of these protocols.
Dana Faiq Abd +3 more
openaire +2 more sources
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.
Avis +28 more
core +1 more source
Linking and Cutting Spanning Trees [PDF]
Algorithms, 2018 We consider the problem of uniformly generating a spanning tree for an undirected connected graph. This process is useful for computing statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs, we prove that this approach significantly outperforms existing algorithms.
Russo, Luís M. S. +2 more
openaire +4 more sources
Molecular Oncology, EarlyView.Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra +10 more
wiley +1 more source
Maksimum jumlah spanning - tree graph terhubung [PDF]
, 1996 Spanning-tree merupakan bagian dari graph yang merupakan suatu tree. Dan dari setiap graph dapat dibentuk paling sedikit satu spanning-tree. Suatu graph G = ( V,E ) yang sederhana dapat ditentukan jumlah spanning-treenya den an inetode penukaran ...
Yuliati , Siti
core
Scale-free trees: the skeletons of complex networks
, 2004 We investigate the properties of the spanning trees of various real-world and model networks. The spanning tree representing the communication kernel of the original network is determined by maximizing total weight of edges, whose weights are given by ...
Dong-Hee Kim +4 more
core +1 more source
Meta‐analysis fails to show any correlation between protein abundance and ubiquitination changes
FEBS Open Bio, EarlyView.We analyzed over 50 published proteomics datasets to explore the relationship between protein levels and ubiquitination changes across multiple experimental conditions and biological systems. Although ubiquitination is often associated with protein degradation, our analysis shows that changes in ubiquitination do not globally correlate with changes in ...
Nerea Osinalde +3 more
wiley +1 more source
Proximity Drawings of High-Degree Trees [PDF]
, 2010 A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree?
Barát J. +5 more
core +1 more source