On minimum average stretch spanning trees in grid graphs

DOI10.1016/J.ENDM.2016.10.033MaRDI QIDQ510965zbMATH OpenOpenAlexFDO

Authors Pankaj Pundir, G. Ramakrishna

Publication date 14 February 2017

Full work available at URL https://doi.org/10.1016/j.endm.2016.10.033

zbMATH Keywords

grid graphsminimum average stretch spanning tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On minimum average stretch spanning trees in polygonal 2-trees
• On minimum average stretch spanning trees in polygonal 2-trees
• The minimum stretch spanning tree problem for typical graphs
• Approximating minimum MAX-stretch spanning trees on unweighted graphs
• Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
• Optimality characterization of the minimum stretch spanning tree problem for interval graphs
• scientific article; zbMATH DE number 2011838
• scientific article; zbMATH DE number 7759283
• On the minimum average distance spanning tree of the hypercube
• On average edge length of minimum spanning trees

Cites work

• Algorithms for Generating Fundamental Cycles in a Graph
• Minimum strictly fundamental cycle bases of planar graphs are hard to find
• On minimum average stretch spanning trees in polygonal 2-trees
• The zoo of tree spanner problems

Cited in

(5)

• The minimum stretch spanning tree problem for typical graphs
• On minimum average stretch spanning trees in polygonal 2-trees
• Optimality computation of the minimum stretch spanning tree problem
• Distance preserving subtrees in minimum average distance spanning trees
• On minimum average stretch spanning trees in polygonal 2-trees

This page was built for publication: On minimum average stretch spanning trees in grid graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510965)