Results 251 to 260 of about 309,634 (292)
Some of the next articles are maybe not open access.

Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems

2017
Building on previous work about counting the number of spanning trees of an unweighted graph, we consider the case of edge-weighted graphs. We present a generalization of the former result to compute in pseudo-polynomial time the exact number of spanning trees of any given weight, and in particular the number of minimum spanning trees.
Antoine Delaite, Gilles Pesant
openaire   +2 more sources

Spanning Trees

2018
Jonathan L. Gross   +2 more
  +4 more sources

Random spanning tree

Journal of Algorithms, 1983
Abstract Dans cet article, nous proposons un algorithme de complexite polynomiale pour construire un arbre au hasard qui soit un graphe partiel d'un graphe donne. Il consiste essentielleement a construire une arborescence de rang donne sur ce graphe, l'ensemble des arborescences etant ordonne par rapport aux valeurs croissantes de la racine et a ...
openaire   +1 more source

Efficient spanning trees

Journal of Optimization Theory and Applications, 1985
The definition of a shortest spanning tree of a graph is generalized to that of an efficient spanning tree for graphs with vector weights, where the notion of optimality is of the Pareto type. An algorithm for obtaining all efficient spanning trees is presented.
openaire   +1 more source

Spanning Trees

2011
Jin Akiyama, Mikio Kano
openaire   +2 more sources

Phylogenetic tree building in the genomic age

Nature Reviews Genetics, 2020
Paschalia Kapli   +2 more
exaly  

Native diversity buffers against severity of non-native tree invasions

Nature, 2023
Camille S Delavaux   +2 more
exaly  

Spanning Trees

2000
Victor N. Kasyanov   +1 more
openaire   +1 more source

Home - About - Disclaimer - Privacy