메뉴 건너뛰기




Volumn 4616 LNCS, Issue , 2007, Pages 182-190

Algorithms for minimum m-connected k-dominating set problem

Author keywords

Approximation algorithm; Connected dominating set; K vertex connectivity; Wireless sensor networks

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL EFFICIENCY; OPTIMIZATION; PROBLEM SOLVING; VIRTUAL REALITY;

EID: 38149074877     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73556-4_21     Document Type: Conference Paper
Times cited : (13)

References (12)
  • 1
    • 0038562914 scopus 로고    scopus 로고
    • Distributed heuristics for connected dominating sets in wireless ad hoc networks
    • Alzoubi, K.M., Wan, P.-J., Frieder, O.: Distributed heuristics for connected dominating sets in wireless ad hoc networks. Journal of Communications and Networks 4(1), 22-29 (2002)
    • (2002) Journal of Communications and Networks , vol.4 , Issue.1 , pp. 22-29
    • Alzoubi, K.M.1    Wan, P.-J.2    Frieder, O.3
  • 3
    • 33746307641 scopus 로고    scopus 로고
    • On constructing k-connected k-dominating set in wireless networks
    • IEEE Computer Society Press, Los Alamitos
    • Dai, F., Wu, J.: On constructing k-connected k-dominating set in wireless networks. IEEE International Parallel and Distributed Processing Symposium. IEEE Computer Society Press, Los Alamitos (2005)
    • (2005) IEEE International Parallel and Distributed Processing Symposium
    • Dai, F.1    Wu, J.2
  • 7
    • 70449438407 scopus 로고    scopus 로고
    • Algorithms for minimum mconnected k-tuple dominating set problem
    • Computer Science to submitted
    • Shang, W.-P., Yao, F., Wan, P.-J., Hu, X.-D.: Algorithms for minimum mconnected k-tuple dominating set problem. Theoretical Computer Science (to submitted)
    • Theoretical
    • Shang, W.-P.1    Yao, F.2    Wan, P.-J.3    Hu, X.-D.4
  • 9
    • 0001790593 scopus 로고
    • Depth first search and linear graph algorithms
    • Tarjan, R.: Depth first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146-160 (1972)
    • (1972) SIAM Journal on Computing , vol.1 , Issue.2 , pp. 146-160
    • Tarjan, R.1
  • 10
    • 1642408650 scopus 로고    scopus 로고
    • Distributed construction of connected dominating set in wireless ad hoc networks
    • Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications 9(2), 141-149 (2004)
    • (2004) Mobile Networks and Applications , vol.9 , Issue.2 , pp. 141-149
    • Wan, P.-J.1    Alzoubi, K.M.2    Frieder, O.3
  • 11
    • 45849142159 scopus 로고    scopus 로고
    • On the construction of 2-connected virtual backbone in wireless networks
    • to appear
    • Wang, F., Thai, T.: On the construction of 2-connected virtual backbone in wireless networks. IEEE Transactions on Wireless Communications (to appear)
    • IEEE Transactions on Wireless Communications
    • Wang, F.1    Thai, T.2
  • 12
    • 32644448886 scopus 로고    scopus 로고
    • Minimum connected dominating sets and maximal independent sets in unit disk graphs
    • Wu, W., Du, H., Jia, X., Li, Y., Huang, C.-H.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoretical Computer Science 352(1), 1-7 (2006)
    • (2006) Theoretical Computer Science , vol.352 , Issue.1 , pp. 1-7
    • Wu, W.1    Du, H.2    Jia, X.3    Li, Y.4    Huang, C.-H.5


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