Results 1 to 10 of about 2,238,100 (388)
Spanning Trees with Many Leaves [PDF]
, 1991 Daniel J. Kleitman, Douglas B. West
openalex +1 more source
Time optimal self-stabilizing spanning tree algorithms [PDF]
, 1993 Sudhanshu Aggarwal, Shay Kutten
openalex +1 more source
A fair rule in minimum cost spanning tree problems [PDF]
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature.
Gustavo Bergantiños, Juan Vidal-Puga
core
A parallel algorithm for computing minimum spanning trees [PDF]
, 1992 D. Barton Johnson, Panagiotis Metaxas
openalex +1 more source
The folk solution and Boruvka's algorithm in minimum cost spanning tree problems [PDF]
The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to share the cost among the nodes (agents). We show that this rule coincides with the folk solution, a very well-known rule of this literature.minimum cost ...
Bergantiños, Gustavo, Vidal-Puga, Juan
core +1 more source
Genetic Algorithms for Balanced Spanning Tree Problem [PDF]
Annals of computer science and information systems, 2015 Riham Moharam, Ehab Morsy, Ismail Ismail
doaj +1 more source
Connected graphs with a minimal number of spanning trees
, 1981 Norbert Gaffke
openalex +1 more source
On spanning 2-trees in a graph
Discrete Applied Mathematics, 1997 The paper presents an approximation algorithm for finding a minimum-weight spanning 2-tree in a weighted complete graph. The asymptotic performance ratio is less than or equal to 2 when the edge weights satisfy the triangle equality, and at most \((3+ 4\sqrt 3)/6\approx 1.655\) when the graph is a complete Euclidean graph on a set of points in the ...
openaire +3 more sources
An egalitarian approach for sharing the cost of a spanning tree. [PDF]
PLoS One, 2020 Giménez-Gómez JM, Peris JE, Subiza B.
europepmc +1 more source