Results 291 to 300 of about 212,144 (329)

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

Independent Spanning Trees in Networks: A Survey

ACM Computing Surveys, 2023
Baolei Cheng, Dajin Wang, Jianxi
exaly  

Spanning Trees

2011
Jin Akiyama, Mikio Kano
openaire   +2 more sources

Spanning Tree And Minumum Cost Spanning Tree

2022
openaire   +1 more source

Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube

IEEE Transactions on Parallel and Distributed Systems, 2021
Baolei Cheng, Dajin Wang
exaly  

Spanning Trees

2000
Victor N. Kasyanov, Viadimir. A. Evstigneev   +1 more
openaire   +1 more source

Spanning Trees on the Sierpinski Gasket

Journal of Statistical Physics, 2007
Shu-Chiuan Chang, Lung-Chi Chen, Wei-Shih Yang   +2 more
exaly  

Constructing spanning trees in augmented cubes

Journal of Parallel and Distributed Computing, 2018
Smruti Mane, Smita Kandekar, Avinash A Patil   +2 more
exaly  

Spanning Trees

2004
openaire   +2 more sources