Strong Connectivity in Directional Nearest-Neighbor Graphs

DOI10.1137/0602049zbMath0496.05022OpenAlexW2023618719MaRDI QIDQ3960867

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

spanning subgraphstrongly connecteddirectional nearest-neighbor graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

An improved construction for spanners of disks ⋮ A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs ⋮ Fault tolerancy of continuous Yao graph of angle less than \(2\pi/5\) ⋮ Continuous Yao graphs ⋮ Unnamed Item ⋮ The \(\varTheta_5\)-graph is a spanner ⋮ Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints ⋮ Odd Yao-Yao Graphs are Not Spanners

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