Scalable analysis and design of ad hoc networks via random graph theory

András Faragó. Scalable analysis and design of ad hoc networks via random graph theory. In Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), Atlanta, Georgia, USA, September 28-28, 2002. pages 43-50, ACM, 2002. [doi]

@inproceedings{Farago02:0,
  title = {Scalable analysis and design of ad hoc networks via random graph theory},
  author = {András Faragó},
  year = {2002},
  doi = {10.1145/570810.570816},
  url = {http://doi.acm.org/10.1145/570810.570816},
  tags = {analysis, graph-rewriting, rewriting, design},
  researchr = {https://researchr.org/publication/Farago02%3A0},
  cites = {0},
  citedby = {0},
  pages = {43-50},
  booktitle = {Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), Atlanta, Georgia, USA,  September 28-28, 2002},
  publisher = {ACM},
  isbn = {1-58113-587-4},
}