Strong Connectivity in Directional Nearest-Neighbor Graphs

DOI10.1137/0602049MaRDI QIDQ3960867zbMATH OpenOpenAlexFDO

Authors B. E. Flinchbaugh, Lee Kenneth Jones

Publication date 1981

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0602049

zbMATH Keywords

directional nearest-neighbor graphspanning subgraphstrongly connected

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cited in

(10)

• Continuous Yao graphs
• The \(\varTheta_5\)-graph is a spanner
• Fault tolerancy of continuous Yao graph of angle less than 2/5
• A low arithmetic-degree algorithm for computing proximity graphs
• Odd Yao-Yao graphs are not spanners
• Spanning properties of Yao and -graphs in the presence of constraints
• Edge sparsification for geometric tour problems
• Computing shortest paths amid non-overlapping weighted disks
• On the spanning and routing ratios of the Yao-four graph
• An improved construction for spanners of disks

This page was built for publication: Strong Connectivity in Directional Nearest-Neighbor Graphs

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