Diameter-preserving spanning trees in sparse weighted graphs
type: Item
instance of: scholarly article
title: Diameter-preserving spanning trees in sparse weighted graphs
zbMATH Open document ID: 1205.05053
author: B. E. Eshmatov
published in: Graphs and Combinatorics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C22
zbMATH DE Number: 5703789
zbMATH Keywords: diameter-preserving spanning tree
zbMATH Keywords: weighted graph
zbMATH Keywords: shortest-paths tree
zbMATH Keywords: minimum diameter spanning tree
MaRDI profile type: Publication
full work available at URL: s00373-010-0887-z
OpenAlex ID: W1969997664
cites work: A note on graphs with diameter-preserving spanning trees
cites work: Introduction to algorithms
cites work: On the minimum diameter spanning tree problem
cites work: Minimum Diameter Spanning Trees and Related Problems
DOI: 10.1007/S00373-010-0887-Z
description: scientific article; zbMATH DE number 5703789