Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints
From MaRDI portal
Publication:5167854
DOI10.1007/978-3-662-43951-7_33zbMath1410.68275arXiv1402.6096OpenAlexW2283899026MaRDI QIDQ5167854
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.6096
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (4)
Establishing symmetric connectivity in directional wireless sensor networks equipped with \(2\pi/3\) antennas ⋮ Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas ⋮ Bounded-angle spanning tree: modeling networks with angular constraints ⋮ The complexity of symmetric connectivity in directional wireless sensor networks
This page was built for publication: Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints