DISTANCE PRESERVING SUBTREES IN MINIMUM AVERAGE DISTANCE SPANNING TREES

DOI10.1142/S1793830913500109zbMath1276.05040OpenAlexW2002536542MaRDI QIDQ2864852

Paulin Melatagia Yonta, René Ndoundam, Maurice Tchuente, Laurent Lyaudet

Publication date: 26 November 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830913500109

zbMATH Keywords

undirected graphdistance preservingminimum average distance spanning tree

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Cites Work

• On the minimum average distance spanning tree of the hypercube
• Approximation algorithms for the shortest total path length spanning tree problem
• Worst-Case Analysis of Network Design Problem Heuristics
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees