Approximating the average stretch factor of geometric graphs

DOI10.20382/JOCG.V3I1A7zbMATH Open1404.68207OpenAlexW2133718038MaRDI QIDQ2968089FDOQ2968089

Authors: Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel Smid 

Publication date: 9 March 2017

Full work available at URL: https://doaj.org/article/5980272888544584952430de55e4e3a1

Recommendations

• Approximating the average stretch factor of geometric graphs
• Average stretch factor: how low does it go?
• Approximating the Stretch Factor of Euclidean Graphs
• scientific article; zbMATH DE number 1809600
• Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (11)

• Approximating the average stretch factor of geometric graphs
• Geometric spanning trees minimizing the Wiener index
• Minimizing the sum of distances to a server in a constraint network
• Average stretch factor: how low does it go?
• Bounded-degree plane geometric spanners in practice
• Approximating average parameters of graphs
• Approximating the Stretch Factor of Euclidean Graphs
• Continuous average Straightness in spatial graphs
• Title not available (Why is that?)
• Geometric spanning trees minimizing the Wiener index
• Analysis of farthest point sampling for approximating geodesics in a graph

This page was built for publication: Approximating the average stretch factor of geometric graphs

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