Highly connected random geometric graphs
type: Item
instance of: scholarly article
title: Highly connected random geometric graphs
zbMATH Open document ID: 1156.05054
author: Béla Bollobás
author: Amites Sarkar
author: Mark Walters
author: Paul Balister
published in: Discrete Applied Mathematics
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 60K99
zbMATH DE Number: 5523158
zbMATH Keywords: random geometric graph
zbMATH Keywords: connectivity
zbMATH Keywords: Poisson process
MaRDI profile type: Publication
full work available at URL: j.dam.2008.03.001
OpenAlex ID: W1966574936
cites work: Connectivity of random k-nearest-neighbour graphs
cites work: Q4398864
cites work: A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
DOI: 10.1016/J.DAM.2008.03.001
description: scientific article; zbMATH DE number 5523158