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

Edge expression based on tree structure

โœ Scribed by Yijia Lin; Jiqing Dou; Eryi Zhang


Book ID
103322657
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
623 KB
Volume
25
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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.