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

scientific article

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

zbMath1297.05221MaRDI QIDQ2921769

No author found.

Publication date: 13 October 2014


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)


Related Items (13)

On the cover time and mixing time of random geometric graphs ⋮ Fast message dissemination in random geometric networks ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Constrained minimum passage time in random geometric graphs ⋮ Size of the giant component in a random geometric graph ⋮ One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity ⋮ Unnamed Item ⋮ Stretch and diameter in random geometric graphs ⋮ On Radio Broadcasting in Random Geometric Graphs ⋮ Initializing sensor networks of non-uniform density in the weak sensor model ⋮ Monotone properties of random geometric graphs have sharp thresholds ⋮ Energy efficient randomised communication in unknown AdHoc networks ⋮ Detecting a botnet in a network




This page was built for publication:

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