메뉴 건너뛰기




Volumn 47, Issue 4, 2007, Pages 421-438

Random geometric graph diameter in the unit ball

Author keywords

Graph diameter; Probabilistic methods; Random geometric graph

Indexed keywords

GRAPH DIAMETERS; RANDOM GEOMETRIC GRAPHS;

EID: 33947574545     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0172-y     Document Type: Conference Paper
Times cited : (38)

References (12)
  • 2
    • 11944253901 scopus 로고    scopus 로고
    • 2nd edn. Cambridge University Press, Cambridge
    • Bollobás, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001).
    • (2001) Random Graphs
    • Bollobás, B.1
  • 8
    • 0033471867 scopus 로고    scopus 로고
    • On k-connectivity for a geometric random graph
    • Penrose, M.D.: On k-connectivity for a geometric random graph. Random Structures Algorithms 15 (1999), 145-164.
    • (1999) Random Structures Algorithms , vol.15 , pp. 145-164
    • Penrose, M.D.1
  • 10
    • 0036377260 scopus 로고    scopus 로고
    • Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks
    • Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Trans. Parallel Distrib. Systems 13 (2002), 14-25.
    • (2002) IEEE Trans. Parallel Distrib. Systems , vol.13 , pp. 14-25
    • Stojmenovic, I.1    Seddigh, M.2    Zunic, J.3
  • 12
    • 23044531399 scopus 로고    scopus 로고
    • A dominating-set-based routing scheme in ad hoc wireless networks
    • Wu, J., Li, H. : A dominating-set-based routing scheme in ad hoc wireless networks. Telecommunication Systems 18 (2001), 13-36.
    • (2001) Telecommunication Systems , vol.18 , pp. 13-36
    • Wu, J.1    Li, H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.