Independent sets in Line of Sight networks
DOI10.1016/J.DAM.2019.03.029zbMATH Open1448.05154OpenAlexW2942569330WikidataQ127965394 ScholiaQ127965394MaRDI QIDQ2201775FDOQ2201775
Publication date: 17 September 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.03.029
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stochastic geometry and its applications
- Optimization, approximation, and complexity classes
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Unit disk graphs
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Graphs on surfaces
- Algorithms for drawing graphs: An annotated bibliography
- On the efficiency of polynomial time approximation schemes
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- Universality considerations in VLSI circuits
- Simple heuristics for unit disk graphs
- Design and analysis of approximation algorithms
- Robust algorithms for restricted domains
- Line-of-Sight Percolation
- Induced Embeddings into Hamming Graphs.
- Graph-Theoretic Concepts in Computer Science
- Elimination Graphs
- Approximation algorithms for intersection graphs
- Line-of-Sight Networks
- Gridline graphs: A review in two dimensions and an extension to higher dimensions
- Dynamic programming optimization in line of sight networks
- Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
Cited In (2)
This page was built for publication: Independent sets in Line of Sight networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201775)