메뉴 건너뛰기




Volumn 59, Issue 1, 1999, Pages 84-93

Self-stabilizing algorithm for detecting fundamental cycles in a graph

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY;

EID: 0033169444     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1622     Document Type: Article
Times cited : (19)

References (16)
  • 3
    • 38249012716 scopus 로고
    • Distributed processing of graphs: Fundamental cycles algorithm
    • Chaudhuri P. Distributed processing of graphs: fundamental cycles algorithm. Inform. Sci. 60:1992;41-50.
    • (1992) Inform. Sci. , vol.60 , pp. 41-50
    • Chaudhuri, P.1
  • 4
    • 0028539517 scopus 로고
    • An efficient distributed bridge-finding algorithm
    • Chaudhuri P. An efficient distributed bridge-finding algorithm. Inform. Sci. 81:1994;73-85.
    • (1994) Inform. Sci. , vol.81 , pp. 73-85
    • Chaudhuri, P.1
  • 5
    • 0028385078 scopus 로고
    • Self-stabilizing depth-first search
    • Collin Z., Dolev S. 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
  • 6
    • 84976834622 scopus 로고
    • Self-stabilizing in spite of distributed control
    • Dijkstra E. W. Self-stabilizing in spite of distributed control. Comm. ACM. 17:1974;643-644.
    • (1974) Comm. ACM. , vol.17 , pp. 643-644
    • Dijkstra, E.W.1
  • 7
    • 0031210477 scopus 로고    scopus 로고
    • A self-stabilizing algorithm for the maximum flow problem
    • Ghosh S., Gupta A., Pemmaraju V. A self-stabilizing algorithm for the maximum flow problem. Distributed Comput. 10:1997;167-180.
    • (1997) Distributed Comput. , vol.10 , pp. 167-180
    • Ghosh, S.1    Gupta, A.2    Pemmaraju, V.3
  • 9
    • 0026817621 scopus 로고
    • A self-stabilizing algorithm for constructing breadth-first trees
    • Huang S. T., Chen N. S. A self-stabilizing algorithm for constructing breadth-first trees. Inform. Process. Lett. 41:1992;109-117.
    • (1992) Inform. Process. Lett. , vol.41 , pp. 109-117
    • Huang, S.T.1    Chen, N.S.2
  • 10
    • 0031680406 scopus 로고    scopus 로고
    • A self-stabilizing algorithm for strong fairness
    • Karaata M. H., Chaudhuri P. A self-stabilizing algorithm for strong fairness. Computing. 60:1998;217-228.
    • (1998) Computing , vol.60 , pp. 217-228
    • Karaata, M.H.1    Chaudhuri, P.2
  • 12
    • 0008708818 scopus 로고
    • Fast, efficient parallel algorithms for some graph problems
    • Savage C., Ja'Ja' J. Fast, efficient parallel algorithms for some graph problems. SIAM J. Comput. 10:1981;682-691.
    • (1981) SIAM J. Comput. , vol.10 , pp. 682-691
    • Savage, C.1    Ja'Ja', J.2
  • 13
  • 14
    • 0027256986 scopus 로고
    • A self-stabilizing algorithm for coloring bipartite graphs
    • Sur S., Srimani P. K. A self-stabilizing algorithm for coloring bipartite graphs. Inform. Sci. 69:1993;219-227.
    • (1993) Inform. Sci. , vol.69 , pp. 219-227
    • Sur, S.1    Srimani, P.K.2
  • 15
    • 0015772414 scopus 로고
    • A note on finding the bridges of a graph
    • Tarjan R. A note on finding the bridges of a graph. Inform. Process. Lett. 2:1974;160-161.
    • (1974) Inform. Process. Lett. , vol.2 , pp. 160-161
    • Tarjan, R.1
  • 16
    • 0021474651 scopus 로고
    • Efficient parallel algorithms for a class of graph theoretic problems
    • Tsin Y. H., Chin F. Y. Efficient parallel algorithms for a class of graph theoretic problems. SIAM J. Comput. 13:1984;580-599.
    • (1984) SIAM J. Comput. , vol.13 , pp. 580-599
    • Tsin, Y.H.1    Chin, F.Y.2


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