Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Continuous Yao graphs

From MaRDI portal
Publication:1693326
Jump to:navigation, search

DOI10.1016/j.comgeo.2017.10.002zbMath1379.05113arXiv1408.4099OpenAlexW1528651684MaRDI QIDQ1693326

André van Renssen, Mohammad Farshi, Perouz Taslakian, Jean-Lou De Carufel, Mirela Damian, Prosenjit Bose, Davood Bakhshesh, Rolf Fagerberg, Sander Verdonschot, Luis Barba

Publication date: 12 February 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.4099


zbMATH Keywords

spannerYao graphspanning ratioself-approaching graph


Mathematics Subject Classification ID

Graph theory (05C99)


Related Items (1)

Fault tolerancy of continuous Yao graph of angle less than \(2\pi/5\)



Cites Work

  • Region-fault tolerant geometric spanners
  • On sparse spanners of weighted graphs
  • Approximating geometric bottleneck shortest paths
  • New and improved spanning ratios for Yao graphs
  • YAO GRAPHS SPAN THETA GRAPHS
  • Geometric Spanner Networks
  • On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
  • Strong Connectivity in Directional Nearest-Neighbor Graphs
  • Self-approaching curves
  • Curves with increasing chords
  • π/2-ANGLE YAO GRAPHS ARE SPANNERS
  • Self-approaching Graphs
  • Increasing-Chord Graphs On Point Sets
  • Improved algorithms for constructing fault-tolerant spanners


This page was built for publication: Continuous Yao graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1693326&oldid=14008648"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 05:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki