Line-of-Sight Networks
From MaRDI portal
Publication:3557508
DOI10.1017/S0963548308009334zbMath1209.05234OpenAlexW2044541981WikidataQ57401471 ScholiaQ57401471MaRDI QIDQ3557508
Warren Debany, R. Ravi, Jon M. Kleinberg, Alan M. Frieze
Publication date: 23 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548308009334
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)
Related Items (8)
Independent Sets in Restricted Line of Sight Networks ⋮ Preface: CALDAM 2017 ⋮ Independent sets in Line of Sight networks ⋮ Finding Large Independent Sets in Line of Sight Networks ⋮ Infinite random geometric graphs ⋮ Dynamic programming optimization in line of sight networks ⋮ Induced Embeddings into Hamming Graphs. ⋮ Continuum line-of-sight percolation on Poisson–Voronoi tessellations
Cites Work
- On the geometry of random Cantor sets and fractal percolation
- Guarding galleries where no point sees a small area.
- Guarding galleries where every point sees a large area
- Percolation
- Random Geometric Graphs
- The capacity of wireless networks
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Splitting an Expander Graph
This page was built for publication: Line-of-Sight Networks
