Results 41 to 50 of about 227,714 (275)
Conditions for Implicit-Degree Sum for Spanning Trees with Few Leaves in K1,4-Free Graphs
Mathematics, 2023 A graph with n vertices is called an n-graph. A spanning tree with at most k leaves is referred to as a spanning k-ended tree. Spanning k-ended trees are important in various fields such as network design, graph theory, and communication networks.
Junqing Cai +3 more
doaj +1 more source
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).
Daniel A. Spielman +3 more
openaire +3 more sources
Advanced Materials Interfaces, EarlyView., 2023 This review discusses the use of Surface‐Enhanced Raman Spectroscopy (SERS) combined with Artificial Intelligence (AI) for detecting antimicrobial resistance (AMR). Various SERS studies used with AI techniques, including machine learning and deep learning, are analyzed for their advantages and limitations.
Zakarya Al‐Shaebi +4 more
wiley +1 more source
Near-linear Time Algorithm for Approximate Minimum Degree Spanning Trees
, 2020 Given a graph $G = (V, E)$, we wish to compute a spanning tree whose maximum vertex degree, i.e. tree degree, is as small as possible. Computing the exact optimal solution is known to be NP-hard, since it generalizes the Hamiltonian path problem. For the
G Yao +6 more
core +1 more source
Minimum congestion spanning trees in planar graphs [PDF]
, 2009 The main purpose of the paper is to develop an approach to evaluation or estimation of the spanning tree congestion of planar graphs.
Ostrovskii, M. I.
core +3 more sources
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
Optimasi Jaringan dengan Spanning Tree untuk Congestion Management
ComTech, 2014 A proper network optimization is needed to deal with problems on the network and to minimize latency in the data flow in a dense network. The data stream is directed into the right channels so that the optimal network speed and latency can be minimized ...
Mayliana Mayliana
doaj +1 more source
Balancing Minimum Spanning and Shortest Path Trees
, 1995 This paper give a simple linear-time algorithm that, given a weighted digraph, finds a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous trade-off: given the two trees and
B. Raghavachari +15 more
core +3 more sources
IEEE Access, 2020 This paper investigates the consensus of second-order multi-agent systems under switched topologies. Previous studies indicate that a consensus cannot be reached if the topology is fixed and has no spanning tree, but it is possible to reach a consensus ...
Dianhao Zheng +4 more
doaj +1 more source
Snarks with Special Spanning Trees [PDF]
Graphs and Combinatorics, 2018 Let $G$ be a cubic graph which has a decomposition into a spanning tree $T$ and a $2$-regular subgraph $C$, i.e. $E(T) \cup E(C) = E(G)$ and $E(T) \cap E(C) = \emptyset$. We provide an answer to the following question: which lengths can the cycles of $C$ have if $G$ is a snark? Note that $T$ is a hist (i.e.
Arthur Hoffmann-Ostenhof +1 more
openaire +3 more sources