메뉴 건너뛰기




Volumn 7611 LNCS, Issue , 2012, Pages 166-180

Lower bounds on information dissemination in dynamic networks

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTION STABILITY; DISSEMINATION ALGORITHMS; DYNAMIC NETWORK; LOWER BOUNDS; NETWORK GRAPH; SYNCHRONOUS NETWORKS; UPPER BOUND;

EID: 84868350559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33651-5_12     Document Type: Conference Paper
Times cited : (34)

References (19)
  • 1
    • 78649807457 scopus 로고    scopus 로고
    • Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
    • Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. Springer, Heidelberg
    • Anta, A.F., Milani, A., Mosteiro, M.A., Zaks, S.: Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 374-388. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6343 , pp. 374-388
    • Anta, A.F.1    Milani, A.2    Mosteiro, M.A.3    Zaks, S.4
  • 2
    • 49049119314 scopus 로고    scopus 로고
    • How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
    • Aceto, L., Damg̊ard, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Springer, Heidelberg
    • Avin, C., Koucký, M., Lotker, Z.: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). In: Aceto, L., Damg̊ard, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121-132. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5125 , Issue.PART I , pp. 121-132
    • Avin, C.1    Koucký, M.2    Lotker, Z.3
  • 9
    • 84868341924 scopus 로고    scopus 로고
    • Information spreading in dynamic networks
    • abs/1112.0384
    • Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z.: Information spreading in dynamic networks. CoRR, abs/1112.0384 (2011)
    • (2011) CoRR
    • Dutta, C.1    Pandurangan, G.2    Rajaraman, R.3    Sun, Z.4
  • 13
    • 15444372084 scopus 로고    scopus 로고
    • Independence free graphs and vertex connectivity augmentation
    • Jackson, B., Jordán, T.: Independence free graphs and vertex connectivity augmentation. Journal of Combinatorial Theory, Series B 94(1), 31-77 (2005)
    • (2005) Journal of Combinatorial Theory, Series B , vol.94 , Issue.1 , pp. 31-77
    • Jackson, B.1    Jordán, T.2
  • 18
    • 79959907809 scopus 로고    scopus 로고
    • Dynamic networks: Models and algorithms
    • Kuhn, F., Oshman, R.: Dynamic networks: Models and algorithms. SIGACT News 42(1), 82-96 (2011)
    • (2011) SIGACT News , vol.42 , Issue.1 , pp. 82-96
    • Kuhn, F.1    Oshman, R.2


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