Results 91 to 100 of about 14,359 (120)
Some of the next articles are maybe not open access.

Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes

2019
For the underlying graph G of a network, k spanning trees of G are called completely independent spanning trees (CISTs for short) if they are mutually inner-node-disjoint. It has been known that determining the existence of k CISTs in a graph is an NP-hard problem, even for \(k=2\).
Kung-Jui Pai   +3 more
openaire   +1 more source

Improving the diameters of completely independent spanning trees in locally twisted cubes

Information Processing Letters, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kung-Jui Pai, Jou-Ming Chang
openaire   +2 more sources

Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees

2016
Completely independent spanning trees \(T_1,T_2,\ldots ,T_k\) in a graph G are spanning trees in G such that for any pair of distinct vertices u and v, the k paths in the spanning trees between u and v mutually have no common edge and no common vertex except for u and v.
openaire   +1 more source

Completely Independent Spanning Trees on 4-Regular Chordal Rings

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2017
Jou-Ming CHANG   +4 more
openaire   +1 more source

An Evidence-based Staging System for Cutaneous Melanoma

Ca-A Cancer Journal for Clinicians, 2004
Arthur Sober   +2 more
exaly  

Phylogenetic tree building in the genomic age

Nature Reviews Genetics, 2020
Paschalia Kapli   +2 more
exaly  

Bacteria living on tree bark consume methane

Nature Reviews Microbiology, 2021
exaly  

Ten reasons to exclude viruses from the tree of life

Nature Reviews Microbiology, 2009
David Moreira, Purificacion Lopez-Garcia
exaly  

Home - About - Disclaimer - Privacy