๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on a spanning 3-tree

โœ Scribed by Masao Tsugaki

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
316 KB
Volume
29
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on the minimum label spanning tre
A note on the minimum label spanning tree
โœ Yingyu Wan; Guoliang Chen; Yinlong Xu ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 44 KB

We give a tight analysis of the greedy algorithm introduced by Krumke and Wirth for the minimum label spanning tree problem. The algorithm is shown to be a (ln(n -1) + 1)-approximation for any graph with n nodes (n > 1), which improves the known performance guarantee 2 ln n + 1.

A note on bisecting minimum spanning tre
A note on bisecting minimum spanning trees
โœ W. M. Boyce; M. R. Garey; D. S. Johnson ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 281 KB
A note on graphs with diameter-preservin
A note on graphs with diameter-preserving spanning trees
โœ Fred Buckley; Martin Lewinter ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 182 KB ๐Ÿ‘ 1 views

The distance between a pair of vertices u, u in a graph G is the length of a shortest path joining u and u. The diameter diam(G) of G is the maximum distance between all pairs of vertices in G. A spanning tree Tof G is diameter preserving if diam(T) = diam(G). In this note, we characterize graphs th

A note on genetic algorithms for degree-
A note on genetic algorithms for degree-constrained spanning tree problems
โœ Zhou, Gengui; Gen, Mitsuo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 58 KB ๐Ÿ‘ 2 views

The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to

A note on space spanning
A note on space spanning
โœ Nelson H. F. Beebe ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 166 KB