메뉴 건너뛰기




Volumn 2, Issue 3-4, 2007, Pages 163-168

Fault tolerant topology control for one-to-all communications in symmetric wireless networks

Author keywords

Fault tolerance; K outconnected graph; Topology control; Wireless networks

Indexed keywords

APPROXIMATION ALGORITHMS; TOPOLOGY; WIRELESS NETWORKS;

EID: 38549159714     PISSN: 17481279     EISSN: 17481287     Source Type: Journal    
DOI: 10.1504/IJSNET.2007.013196     Document Type: Article
Times cited : (11)

References (12)
  • 2
    • 0005269528 scopus 로고    scopus 로고
    • On rooted node-connectivity problems
    • Cheriyan, J., Jordan, T. and Nutov, Z. (2001) 'On rooted node-connectivity problems', Algorithmica, Vol. 30, No. 3, pp. 353-375.
    • (2001) Algorithmica , vol.30 , Issue.3 , pp. 353-375
    • Cheriyan, J.1    Jordan, T.2    Nutov, Z.3
  • 6
    • 0015955981 scopus 로고
    • Disjoint paths in a network
    • Suurballe, J. W. (1974) 'Disjoint paths in a network', Networks, pp. 125-145.
    • (1974) Networks , pp. 125-145
    • Suurballe, J.W.1
  • 9
    • 0000576654 scopus 로고
    • Ecken vom grad n in minimalen n-fach zusammenhangenden graphen
    • Mader, W. (1972) 'Ecken vom grad n in minimalen n-fach zusammenhangenden graphen', Archive der Mathematik, Vol. 23, pp. 219-224.
    • (1972) Archive der Mathematik , vol.23 , pp. 219-224
    • Mader, W.1


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