Connectivity in a random interval graph with access points

DOI10.1016/J.IPL.2009.01.002MaRDI QIDQ987785zbMATHOpenAlexFDO

Authors Yilun Shang

Publication date 16 August 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2009.01.002

zbMATH Keywords

random graphconnectivitywireless networkcombinatorial problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• On the connectivity of a random interval graph
• Connectivity of soft random geometric graphs over annuli
• Connectivity of the uniform random intersection graph
• The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
• Random interval graphs

Cites work

• scientific article; zbMATH DE number 3308309 (Why is no real title available?)
• A tutorial survey of topics in wireless networking. II
• Connectivity in finite ad-hoc networks
• On the connectivity of a random interval graph
• Random Geometric Graphs

Cited in

(2)

• A note on the 2-connectivity in one-dimensional ad hoc networks
• Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem

This page was built for publication: Connectivity in a random interval graph with access points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987785)