메뉴 건너뛰기




Volumn 58, Issue 1, 1999, Pages 215-221

A self-stabilizing distributed algorithm to find the median of a tree graph

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; FORMAL LOGIC;

EID: 0033076990     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1606     Document Type: Article
Times cited : (9)

References (17)
  • 3
    • 0024683246 scopus 로고
    • Token systems that self-stabilize
    • G. M. Brown, M. G. Gouda, and C. L. Wu, Token systems that self-stabilize, IEEE Trans. Comput. 38 (6) (1989), 845-852.
    • (1989) IEEE Trans. Comput. , vol.38 , Issue.6 , pp. 845-852
    • Brown, G.M.1    Gouda, M.G.2    Wu, C.L.3
  • 4
    • 0028385078 scopus 로고
    • Self-stabilizing depth-first search
    • Z. Collin and S. Dolev, Self-stabilizing depth-first search, Inform. Process. Lett. 49 (1994), 297-301.
    • (1994) Inform. Process. Lett. , vol.49 , pp. 297-301
    • Collin, Z.1    Dolev, S.2
  • 5
    • 0011540529 scopus 로고
    • A self-stabilizing distributed algorithm for all-pairs shortest path problem
    • S. Chandrasekar and P. K. Srimani, A self-stabilizing distributed algorithm for all-pairs shortest path problem, Parallel Algorithms Appl. 4 (1&2) (1994), 125-137.
    • (1994) Parallel Algorithms Appl. , vol.4 , Issue.1-2 , pp. 125-137
    • Chandrasekar, S.1    Srimani, P.K.2
  • 6
    • 84976834622 scopus 로고
    • Self-stabilizing systems in spite of distributed control
    • E. W. Dijkstra, Self-stabilizing systems in spite of distributed control, Commun. ACM 17 (11) (1974), 643-644.
    • (1974) Commun. ACM , vol.17 , Issue.11 , pp. 643-644
    • Dijkstra, E.W.1
  • 7
    • 0022582906 scopus 로고
    • A belated proof of self-stabilization
    • E. W. Dijkstra, A belated proof of self-stabilization, J. Distrib. Comput. 1 (1) (1986), 5-6.
    • (1986) J. Distrib. Comput. , vol.1 , Issue.1 , pp. 5-6
    • Dijkstra, E.W.1
  • 8
    • 0028449066 scopus 로고
    • Two state self-stabilizing algorithms for token rings
    • M. Flatebo and A. K. Datta, Two state self-stabilizing algorithms for token rings, IEEE Trans. Software Eng. 20(6) (1994), 500-504.
    • (1994) IEEE Trans. Software Eng. , vol.20 , Issue.6 , pp. 500-504
    • Flatebo, M.1    Datta, A.K.2
  • 9
    • 0025702469 scopus 로고
    • Stabilizing unison
    • M. Gouda and T. Herman, Stabilizing unison, Inf. Process. Lett. 35(4) (1990), 171-175.
    • (1990) Inf. Process. Lett. , vol.35 , Issue.4 , pp. 171-175
    • Gouda, M.1    Herman, T.2
  • 11
    • 0003780715 scopus 로고
    • Addison-Wesley, Reading, MA
    • F. Harary, "Graph Theory," Addison-Wesley, Reading, MA, 1972.
    • (1972) Graph Theory
    • Harary, F.1
  • 13
    • 0024072262 scopus 로고
    • An exercise in proving self-stabilization with a variant function
    • J. L. W. Kessels, An exercise in proving self-stabilization with a variant function, Inf. Process. Lett. 29(2) (1988), 39-42.
    • (1988) Inf. Process. Lett. , vol.29 , Issue.2 , pp. 39-42
    • Kessels, J.L.W.1
  • 14
    • 0002166475 scopus 로고
    • Self-stabilizing extensions for message passing systems
    • S. Katz and K. J. Perry, Self-stabilizing extensions for message passing systems, Distrib. Comput. 7(1) (1993), 17-26.
    • (1993) Distrib. Comput. , vol.7 , Issue.1 , pp. 17-26
    • Katz, S.1    Perry, K.J.2
  • 16
    • 0027553308 scopus 로고
    • Self-stabilization
    • M. Schneider, Self-stabilization, ACM Comput. Surv. 25(1) (1993), 45-67.
    • (1993) ACM Comput. Surv. , vol.25 , Issue.1 , pp. 45-67
    • Schneider, M.1


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