Results 71 to 80 of about 3,899,169 (179)
Completely independent spanning trees in Eisenstein-Jacobi networks
Abstract In this work, we propose construction algorithms to build Completely Independent Spanning Trees (CIST) in EJ networks with time complexity of $O(n)$, where $n$ is the total number of nodes in the network. We present a sequential and a parallel CISTs construction algorithms.
Zaid A. Hussain +2 more
openaire +2 more sources
Realizing efficient outcomes in cost spanning problems [PDF]
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. The only subgame equilibrium payoff is efficient. Moreover, we extend the result to the case of budget restrictions.
Gustavo Bergantiños, Juan Vidal-Puga
core
Independent Spanning Trees With Small Depths in Iterated Line Digraphs
. We show that the independent spanning tree conjecture on digraphs is true if we restrict ourselves to line digraphs. Also, we construct independent spanning trees with small depths in iterated line digraphs.
Toru Hasunuma, Hiroshi Nagamochi
core
Spanning trees and spanners [PDF]
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation ...
Eppstein, David
core +1 more source
Finding Four Independent Trees
Motivated by a multi-tree approach to the design of reliable communication protocols, Itai and Rodeh gave a linear time algorithm for finding two independent spanning trees in a 2-connected graph.
Avenida Albert Einstein +2 more
core
Background Rapid diversification in island floras often creates taxonomic uncertainty, particularly for morphologically variable plant complexes. The Cirsium japonicum complex, a widespread and medicinally important group in East Asia, exemplifies this ...
Chih-Yi Chang +5 more
doaj +1 more source
During infection with Plasmodium falciparum in pregnancy, parasites express a unique virulence factor, VAR2CSA, that mediates binding of infected red blood cells to the placenta.
Simranjit Grewal +5 more
doaj +1 more source
Background The evaluation of genomic selection (GS) efficiency in forestry has primarily relied on cross-validation schemes that split the same population within a single generation for both training and validation. While useful, this approach may not be
Haleh Hayatgheibi +8 more
doaj +1 more source
Dementia and its earlier stages mild cognitive impairment (MCI) and subjective cognitive decline (SCD) are increasingly common, yet automated tools that distinguish all four cognitive states simultaneously remain rare.
Mohamed Sherif N. Abd Rabou +5 more
doaj +1 more source
Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems [PDF]
The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network ...
Ghosh, Diptesh
core

