Results 221 to 230 of about 140,549 (266)

Cities as stepping stones for climate-driven tree species range shifts

open access: yes
Haesen S   +6 more
europepmc   +1 more source

Independent Spanning Trees of Chordal Rings

open access: yesIndependent Spanning Trees of Chordal Rings
openaire  
Some of the next articles are maybe not open access.

Related searches:

Independent Spanning Trees in Networks: A Survey

ACM Computing Surveys, 2023
The problem of constructing independent spanning trees (ISTs) dates back to as early as the late 1980s. Given a network G of a certain topology, the question is whether we can, as well as how to, construct a set of ISTs in G .
Baolei Cheng, Dajin Wang, Jianxi Fan
exaly   +2 more sources

Completely Independent Spanning Trees in Line Graphs

open access: yesGraphs and Combinatorics, 2023
20 pages with 5 ...
Toru Hasunuma
exaly   +3 more sources

Independent spanning trees in crossed cubes

Information Sciences, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baolei Cheng, Jianxi Fan, Xiaohua Jia
exaly   +7 more sources

Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees

open access: yesDiscrete Applied Mathematics, 2018
The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by defining (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges ...
Nicolas Gastineau, Olivier Togni
exaly   +4 more sources

Node-independent spanning trees in Gaussian networks [PDF]

open access: yesJournal of Parallel and Distributed Computing, 2017
Message broadcasting in networks could be carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at node $r$. Second, for every node $u$ in the network, all trees' paths from $r$ to $u$ are node-disjoint, excluding the end nodes $r$ and $u$.
Zaid Hussain   +2 more
exaly   +3 more sources

Independent spanning trees on even networks

Information Sciences, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jong-Seok Kim   +2 more
exaly   +3 more sources

On independent spanning trees

Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Samir Khuller, Baruch Schieber
openaire   +1 more source

Ore’s condition for completely independent spanning trees

open access: yesDiscrete Applied Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Genghua Fan, Yanmei Hong, Qinghai Liu
exaly   +3 more sources

Home - About - Disclaimer - Privacy