The bin-covering technique for thresholding random geometric graph properties
type: Item
instance of: scholarly article
zbMATH Open document ID: 1297.05221
publication date: 2014-10-13T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 6354923
MaRDI profile type: Publication
Recommended article: Thresholding random geometric graph properties motivated by ad hoc sensor networks
Recommended article: On threshold probabilities for the realization of a random graph by a geometric graph
Recommended article: On Sharp Thresholds in Random Geometric Graphs
Recommended article: Testing thresholds for high-dimensional sparse random geometric graphs
Recommended article: The connectivity threshold of random geometric graphs with Cantor distributed vertices
Recommended article: An exact threshold theorem for random graphs and the node-packing problem
Recommended article: Automata, Languages and Programming
Recommended article: The cover time of random geometric graphs
Recommended article: Q4633810
Recommended article: Threshold Functions for Random Graphs on a Line Segment
author: S. Muthukrishnan
author: Gopal Pandurangan
title: The bin-covering technique for thresholding random geometric graph properties
description: scientific article; zbMATH DE number 6354923