Optimality computation of the minimum stretch spanning tree problem

Lan Lin and Yixun Lin

Applied Mathematics and Computation, 2020, vol. 386, issue C

Abstract: The minimum stretch spanning tree problem for a graph G is to find a spanning tree T of G such that the maximum distance in T between two adjacent vertices of G is minimized, where the minimum value is called the tree-stretchof G. There has been extensive study on the algorithmic aspects, such as the NP-hardness and fixed-parameter solvability. We are concerned in this paper with the computation of exact tree-stretch for given graph families. We relate an optimization approach of computing lower and upper bounds. This approach is applied to several typical graph families, such as the hypercubes Qn, the graph products Km × Kn, Pm × Kn, Cm × Cn, Pm × Cn, Pm × Pn, and Km × Cn.

Keywords: Discrete optimization; Spanning tree; Tree spanner; Tree-stretch; Fundamental cycle (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320304604
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:386:y:2020:i:c:s0096300320304604

DOI: 10.1016/j.amc.2020.125502

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().