On minimum average stretch spanning trees in grid graphs

DOI10.1016/j.endm.2016.10.033zbMath1356.05023OpenAlexW2556274545MaRDI QIDQ510965

G. Ramakrishna, Pankaj Pundir

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)

Cites Work

• 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
• Algorithms for Generating Fundamental Cycles in a Graph

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