✦ LIBER ✦

Some results on spanning trees

✍ Scribed by Bing Yao; Zhong-fu Zhang; Jian-fang Wang

Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2010
Tongue: English
Weight: 211 KB
Volume: 26
Category: Article
ISSN: 0168-9673
DOI: 10.1007/s10255-010-0011-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On some multivariate gamma-distributions

On some multivariate gamma-distributions connected with spanning trees

✍ T. Royen 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 512 KB

On Polynomials of Spanning Trees

✍ F. Chung; C. Yang 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 119 KB

Some results on symmetric double starlik

Some results on symmetric double starlike trees

✍ Mirjana Lazić 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 188 KB

On the approximability of some maximum s

On the approximability of some maximum spanning tree problems

✍ Giulia Galbiati; Angelo Morzenti; Francesco Maffioli 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 844 KB

We study the approximability of some problems which aim at finding spanning trees in undirected graphs which maximize, rather than minimize, a single objective function representing a form of benefit or usefulness of the tree. We prove that the problem of finding a spanning tree which maximizes the

On the asymptotic growth rate of some sp

On the asymptotic growth rate of some spanning trees embedded in

✍ Pedro M.M. de Castro; Olivier Devillers 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 256 KB

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.