Highly connected random geometric graphs (Q1003675): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.03.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966574936 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connectivity of random <i>k</i>-nearest-neighbour graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4398864 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. / rank | |||
Normal rank | |||
Latest revision as of 02:36, 29 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Highly connected random geometric graphs |
scientific article |
Statements
Highly connected random geometric graphs (English)
0 references
4 March 2009
0 references
random geometric graph
0 references
connectivity
0 references
Poisson process
0 references
