On sparse spanners of weighted graphs
type: Item
instance of: scholarly article
title: On sparse spanners of weighted graphs
zbMATH Open document ID: 0762.05039
DOI: 10.1007/BF02189308
author: S. Singh
published in: Discrete \& Computational Geometry
publication date: 1992-12-14T00:00:00Z
full work available at URL: https://eudml.org/doc/131235
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 78494
zbMATH Keywords: distance
zbMATH Keywords: algorithm
zbMATH Keywords: sparse spanners
zbMATH Keywords: weighted graphs
zbMATH Keywords: planar graphs
zbMATH Keywords: Euclidean graphs
MaRDI profile type: Publication
cites work: On optimal realizations of finite metric spaces by graphs
cites work: Complexity of network synchronization
cites work: Q4733694
cites work: Routing with Polynomial Communication-Space Trade-Off
cites work: Reconstructing the shape of a tree from observed dissimilarity data
cites work: Q3852212
cites work: Q4039784
cites work: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
cites work: Delaunay graphs are almost as good as complete graphs
cites work: Q3484375
cites work: Q5725269
cites work: Q3802644
cites work: Partitions ofN-Space by Hyperplanes
cites work: Q3484376
cites work: Regular d-valent graphs of girth 6 and 2(d2−d+1) vertices
cites work: Ramanujan graphs
cites work: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
cites work: Graph spanners
cites work: An Optimal Synchronizer for the Hypercube
cites work: Shortest paths in Euclidean graphs
cites work: A note on the tree realizability of a distance matrix
cites work: Q3707420
OpenAlex ID: W2002041206
description: scientific article; zbMATH DE number 78494