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

On Polynomials of Spanning Trees

โœ Scribed by F. Chung; C. Yang

Publisher
Springer
Year
2000
Tongue
English
Weight
119 KB
Volume
4
Category
Article
ISSN
0218-0006

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Some results on spanning trees
Some results on spanning trees
โœ Bing Yao; Zhong-fu Zhang; Jian-fang Wang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 211 KB
On Minimum Edge Ranking Spanning Trees
On Minimum Edge Ranking Spanning Trees
โœ Kazuhisa Makino; Yushi Uno; Toshihide Ibaraki ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 243 KB

In this paper, we introduce the problem of computing a minimum edge ranking spanning tree (MERST); i.e., find a spanning tree of a given graph G whose edge ranking is minimum. Although the minimum edge ranking of a given tree can be computed in polynomial time, we show that problem MERST is NP-hard.

On finding most uniform spanning trees
On finding most uniform spanning trees
โœ Zvi Galil; Baruch Schieber ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 243 KB
On random minimum length spanning trees
On random minimum length spanning trees
โœ A. M. Frieze; C. J. H. McDiarmid ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 446 KB