메뉴 건너뛰기




Volumn 29, Issue 2, 1999, Pages 600-614

Self-stabilizing algorithms for finding centers and medians of trees

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING; THEOREM PROVING;

EID: 0033298447     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798427156     Document Type: Article
Times cited : (46)

References (34)
  • 4
    • 0003953404 scopus 로고
    • Addison-Wesley, Advanced Book Program, Redwood City, CA
    • F. BUCKLEY AND F. HARARY, Distance in Graphs, Addison-Wesley, Advanced Book Program, Redwood City, CA, 1990.
    • (1990) Distance in Graphs
    • Buckley, F.1    Harary, F.2
  • 6
    • 0026204132 scopus 로고
    • A self-stabilizing algorithm for constructing spanning trees
    • N. S. CHEN, F. P. YU, AND S. T. HUANG, A self-stabilizing algorithm for constructing spanning trees, Inform. Process. Lett., 39 (1991), pp. 147-151.
    • (1991) Inform. Process. Lett. , vol.39 , pp. 147-151
    • Chen, N.S.1    Yu, F.P.2    Huang, S.T.3
  • 7
    • 0028385078 scopus 로고
    • Self-stabilizing depth-first search
    • Z. COLLIN AND S. DOLEV, Self-stabilizing depth-first search, Inform. Process. Lett., 49 (1994), pp. 297-301.
    • (1994) Inform. Process. Lett. , vol.49 , pp. 297-301
    • Collin, Z.1    Dolev, S.2
  • 8
    • 0006036921 scopus 로고
    • Some beautiful arguments using mathematical induction
    • E. W. DIJKSTRA, Some beautiful arguments using mathematical induction, Acta Inform., 13 (1980), pp. 1-8.
    • (1980) Acta Inform. , vol.13 , pp. 1-8
    • Dijkstra, E.W.1
  • 10
    • 0020168225 scopus 로고
    • Vertex centers of trees
    • A. M. FARLEY, Vertex centers of trees, Transportation Science, 16 (1982), pp. 265-280.
    • (1982) Transportation Science , vol.16 , pp. 265-280
    • Farley, A.M.1
  • 11
    • 85025539320 scopus 로고
    • Computation of the center and diameter of outerplanar graphs
    • A. M. FARLEY AND A. PROSKUROWSKI, Computation of the center and diameter of outerplanar graphs, Discrete Appl. Math., 2 (1980), pp. 185-191.
    • (1980) Discrete Appl. Math. , vol.2 , pp. 185-191
    • Farley, A.M.1    Proskurowski, A.2
  • 13
    • 0031210477 scopus 로고    scopus 로고
    • A self-stabilizing algorithm for the maximum flow problem
    • S. GHOSH, A. GUPTA, AND S. V. PEMMARAJU, A self-stabilizing algorithm for the maximum flow problem, Distrib. Comput., 10 (1997), pp. 8-14.
    • (1997) Distrib. Comput. , vol.10 , pp. 8-14
    • Ghosh, S.1    Gupta, A.2    Pemmaraju, S.V.3
  • 14
    • 0001917377 scopus 로고
    • A self-stabilizing algorithm for coloring planar graphs
    • S. GHOSH AND M. H. KARAATA, A self-stabilizing algorithm for coloring planar graphs, Distrib. Comput., 7 (1993), pp. 55-59.
    • (1993) Distrib. Comput. , vol.7 , pp. 55-59
    • Ghosh, S.1    Karaata, M.H.2
  • 15
    • 0015434070 scopus 로고
    • Minimax location of a facility in a network
    • A. J. GOLDMAN, Minimax location of a facility in a network, Transportation Science, 6 (1972), pp. 407-418.
    • (1972) Transportation Science , vol.6 , pp. 407-418
    • Goldman, A.J.1
  • 17
    • 0003780715 scopus 로고
    • Addison-Wesley, Reading, MA
    • F. HARARY, Graph Theory, Addison-Wesley, Reading, MA, 1972.
    • (1972) Graph Theory
    • Harary, F.1
  • 18
    • 0019565510 scopus 로고
    • Linear algorithms for finding the jordan center and path center of a tree
    • S. M. HEDETNIEMI, E. J. COCKAYNE, AND S. T. HEDETNIEMI, Linear algorithms for finding the jordan center and path center of a tree, Transportation Science, 15 (1981), pp. 98-114.
    • (1981) Transportation Science , vol.15 , pp. 98-114
    • Hedetniemi, S.M.1    Cockayne, E.J.2    Hedetniemi, S.T.3
  • 19
    • 0025437145 scopus 로고
    • Probabilistic self-stabilization
    • T. HERMAN, Probabilistic self-stabilization, Inform. Process. Lett., 35 (1990), pp. 63-67.
    • (1990) Inform. Process. Lett. , vol.35 , pp. 63-67
    • Herman, T.1
  • 20
    • 0002792857 scopus 로고
    • A self-stabilizing algorithm for maximal matching
    • S. C. HSU AND S. T. HUANG, A self-stabilizing algorithm for maximal matching, Inform. Process. Lett., 43 (1992), pp. 77-81.
    • (1992) Inform. Process. Lett. , vol.43 , pp. 77-81
    • Hsu, S.C.1    Huang, S.T.2
  • 24
    • 0018683792 scopus 로고
    • An algorithmic approach to network location problems. I: The p-centers
    • O. KARIV AND S. L. HAKIMI, An algorithmic approach to network location problems. I: The p-centers, SIAM J. Appl. Math., 37 (1979), pp. 513-538.
    • (1979) SIAM J. Appl. Math. , vol.37 , pp. 513-538
    • Kariv, O.1    Hakimi, S.L.2
  • 25
    • 0018678438 scopus 로고
    • An algorithmic approach to network location problems. II: The p-medians
    • O. KARIV AND S. L. HAKIMI, An algorithmic approach to network location problems. II: The p-medians, SIAM J. Appl. Math., 37 (1979), pp. 539-560.
    • (1979) SIAM J. Appl. Math. , vol.37 , pp. 539-560
    • Kariv, O.1    Hakimi, S.L.2
  • 28
    • 0002408822 scopus 로고
    • Self-stabilization (in spite of distributed control) in tree-structured systems
    • H. S. M. KRUIJER, Self-stabilization (in spite of distributed control) in tree-structured systems, Inform. Process. Lett., 8 (1979), pp. 91-95.
    • (1979) Inform. Process. Lett. , vol.8 , pp. 91-95
    • Kruijer, H.S.M.1
  • 29
    • 0020787246 scopus 로고
    • On powers and centers of chordal graphs
    • R. LASKAR AND D. SHIER, On powers and centers of chordal graphs, Discrete Appl. Math., 6 (1983), pp. 139-147.
    • (1983) Discrete Appl. Math. , vol.6 , pp. 139-147
    • Laskar, R.1    Shier, D.2
  • 31
    • 0024639722 scopus 로고
    • A generalized algorithm for centrality problems on trees
    • A. ROSENTHAL AND J. PINO, A generalized algorithm for centrality problems on trees, J. ACM, 36 (1989), pp. 349-361.
    • (1989) J. ACM , vol.36 , pp. 349-361
    • Rosenthal, A.1    Pino, J.2
  • 34
    • 0006110972 scopus 로고
    • A self-stabilizing distributed algorithm for BFS spanning trees of a symmetric graph
    • S. SUR AND P. K. SRIMANI, A self-stabilizing distributed algorithm for BFS spanning trees of a symmetric graph, Parallel Process. Lett., 2 (1992), pp. 171-179.
    • (1992) Parallel Process. Lett. , vol.2 , pp. 171-179
    • Sur, S.1    Srimani, P.K.2


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