Random channel assignment in the plane
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1118889 (Why is no real title available?)
- scientific article; zbMATH DE number 227027 (Why is no real title available?)
- scientific article; zbMATH DE number 3228674 (Why is no real title available?)
- scientific article; zbMATH DE number 3282420 (Why is no real title available?)
- Introdction to Measure and Probability
- Random Geometric Graphs
- Robust algorithms for restricted domains
Cited in
(19)- High level communication functionalities for wireless sensor networks
- Frequency-distance constraints with large distances
- On the span of a random channel assignment problem
- Improper colouring of (random) unit disk graphs
- On the treewidth of random geometric graphs and percolated grids
- Central limit theorems for \(U\)-statistics of Poisson point processes
- Clique number and ball containment number of unit ball graphs
- Bisectored unit disk graphs
- Graph imperfection and channel assignment
- Maker-breaker games on random geometric graphs
- The chromatic and clique numbers of random scaled sector graphs
- Clique colourings of geometric graphs
- Sunflower hard disk graphs
- Maximum scan statistics and channel assignment problems in homogeneous wireless networks
- On treewidth and related parameters of random geometric graphs
- On the chromatic number of random geometric graphs
- Improper coloring of unit disk graphs
- Two-point concentration in random geometric graphs
- Distributed coloring and the local structure of unit-disk graphs
This page was built for publication: Random channel assignment in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4800395)