Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Connectivity in a random interval graph with access points

From MaRDI portal
Publication:987785
Jump to:navigation, search

DOI10.1016/J.IPL.2009.01.002zbMath1202.68290OpenAlexW2032940443MaRDI QIDQ987785

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

wireless networkcombinatorial problemsconnectivityrandom graph


Mathematics Subject Classification ID

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


Related Items (1)

A note on the 2-connectivity in one-dimensional ad hoc networks




Cites Work

  • Unnamed Item
  • A tutorial survey of topics in wireless networking. II
  • Connectivity in finite ad-hoc networks
  • Random Geometric Graphs
  • On the connectivity of a random interval graph




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:987785&oldid=12979164"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 20:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki