Colouring random geometric graphs
A random geometric graph $G_n$ is obtained as follows. We take $X_1, X_2, \ldots, X_n ∈\mathbb{R}^d$ at random (i.i.d. according to some probability distribution ν on $\mathbb{R}^d$). For $i ≠j$ we join $X_i$ and $X_j$ by an edge if $║X_i - X_j ║< r(n)$. We study the properties of the chromatic numb...
Shranjeno v:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
| Serija: | Discrete Mathematics & Theoretical Computer Science |
| Teme: | |
| Online dostop: | https://dmtcs.episciences.org/3440/pdf |
| Oznake: |
Brez oznak, prvi označite!
|