Results 51 to 60 of about 119,472 (328)
Fast Distributed Approximation for TAP and 2-Edge-Connectivity [PDF]
, 2018 The tree augmentation problem (TAP) is a fundamental network design problem, in which the input is a graph $G$ and a spanning tree $T$ for it, and the goal is to augment $T$ with a minimum set of edges $Aug$ from $G$, such that $T \cup Aug$ is 2-edge ...
Censor-Hillel, Keren, Dory, Michal
core +2 more sources
Application of neutrosophic minimum spanning tree in electrical power distribution network [PDF]
CAAI Transactions on Intelligence Technology, 2020 The problem of finding the minimum spanning tree (MST) is one of the most studied and important combinatorial optimisation problems in graph theory. Several types of uncertainties exist in real‐life problems, which make it very hard to find the exact length of the arc.
Xiao Qun Liao, Tong Su, Li Ma
openaire +2 more sources
Distributed Adaptive Consensus Disturbance Rejection: a Directed-spanning-tree Perspective
Cybersecurity and Cyberforensics Conference, 2022 In this paper, we revisit the problem of consensus disturbance rejection for multiagent systems over a digraph, but from a different perspective, i.e., the perspective of a directed spanning tree (DST). When the minimum nonzero real part of the Laplacian
Dongdong Yue, S. Baldi, Jinde Cao
semanticscholar +1 more source
AlgorithmsThis paper considers the solvability of several fundamental problems in asynchronous message-passing distributed systems in the presence of Byzantine processes using distributed algorithms.
Ajay D. Kshemkalyani, Anshuman Misra
doaj +1 more source
Directed distributed system: Backtracking problem
Труды Института системного программирования РАН, 2018 For a distributed system based on a directed graph without multiple edges and loops, the backtracing problem is considered: how to transfer a message from the final vertex of the arc to its initial vertex.
I. B. Burdonov, A. S. Kossatchev
doaj +1 more source
VM BASED EVALUATION OF THE SCALABLE PARALLEL MINIMUM SPANNING TREE ALGORITHM FOR PGAS MODEL
9th International Conference "Distributed Computing and Grid Technologies in Science and Education", 2021 The minimum spanning tree problem has influential importance in computer science, networkanalysis, and engineering. However, the sequential algorithms become unable to process the givenproblem as the volume of the data representing graph instances ...
V. Bejanyan, H. Astsatryan
semanticscholar +1 more source
Frontiers in Microbiology, 2020 Candida tropicalis is a globally distributed human pathogenic yeast, and its increasing resistance to azoles makes clinical treatment difficult. In this study, we investigated the clinical features, azole resistance and genetic relatedness of 87 C ...
Qianyu Wang +5 more
doaj +1 more source
Estimation of Recent Transmission of Mycobacterium Tuberculosis Strains among Iranian and Afghan Immigrants: A Cluster-Based Study [PDF]
Journal of Clinical and Diagnostic Research, 2014 Background: Iran has extended borders with high-TB burden countries (Afghanistan and Pakistan) and immigrations of these populations influences TB distribution in the region and threatens the control strategies.
Mohammad Reza Allahyar Torkaman +5 more
doaj +1 more source
Time-Message Trade-Offs in Distributed Algorithms [PDF]
, 2018 This paper focuses on showing time-message trade-offs in distributed algorithms for fundamental problems such as leader election, broadcast, spanning tree (ST), minimum spanning tree (MST), minimum cut, and many graph verification problems.
Gmyr, Robert, Pandurangan, Gopal
core +2 more sources
Microorganisms, 2020 Mycobacterium intracellulare is a leading cause of nontuberculous mycobacterial pulmonary disease, with a rapidly increasing prevalence worldwide. This bacterium, commonly distributed in soil and water, is known to be transmitted through the environment ...
Jeong-Ih Shin +13 more
doaj +1 more source