메뉴 건너뛰기




Volumn 3618, Issue , 2005, Pages 212-223

A bridge between the asynchronous message passing model and local computations in graphs

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS MESSAGE-PASSING MODELS; LOCAL COMPUTATIONS IN GRAPHS; MODEL COMPUTATION;

EID: 26844462739     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_19     Document Type: Conference Paper
Times cited : (12)

References (16)
  • 5
    • 84957017428 scopus 로고    scopus 로고
    • An effective characterization of computability in anonymous networks
    • [BV01] Jennifer L. Welch, editor, Distributed Computing. 15th International Conference, DISC 2001, Springer-Verlag
    • [BV01] Paolo Boldi and Sebastiano Vigna. An effective characterization of computability in anonymous networks. In Jennifer L. Welch, editor, Distributed Computing. 15th International Conference, DISC 2001, volume 2180 of Lecture Notes in Computer Science, pages 33-47. Springer-Verlag, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2180 , pp. 33-47
    • Boldi, P.1    Vigna, S.2
  • 6
    • 31244432784 scopus 로고    scopus 로고
    • Fibrations of graphs
    • [BV02]
    • [BV02] P. Boldi and S. Vigna. Fibrations of graphs. Discrete Math., 243:21-66, 2002.
    • (2002) Discrete Math. , vol.243 , pp. 21-66
    • Boldi, P.1    Vigna, S.2
  • 7
    • 36649011681 scopus 로고    scopus 로고
    • Election and local computations on closed unlabelled edges
    • [Cha05] number 3381 in LNCS
    • [Cha05] J. Chalopin. Election and local computations on closed unlabelled edges (extended abstract). In Proc.of SOFSEM 2005, number 3381 in LNCS, pages 81-90, 2005.
    • (2005) Proc.of SOFSEM 2005 , pp. 81-90
    • Chalopin, J.1
  • 10
    • 0141854015 scopus 로고    scopus 로고
    • Hundreds of impossibility results for distributed computing
    • [FR03]
    • [FR03] F. Fich and E. Ruppert. Hundreds of impossibility results for distributed computing. Distributed computing, 16:121-163, 2003.
    • (2003) Distributed Computing , vol.16 , pp. 121-163
    • Fich, F.1    Ruppert, E.2
  • 11
    • 1642586158 scopus 로고    scopus 로고
    • Characterization of classes of graphs recognizable by local computations
    • [GMM04]
    • [GMM04] E. Godard, Y. Métivier, and A. Muscholl. Characterization of Classes of Graphs Recognizable by Local Computations. Theory of Computing Systems, (37):249-293, 2004.
    • (2004) Theory of Computing Systems , Issue.37 , pp. 249-293
    • Godard, E.1    Métivier, Y.2    Muscholl, A.3
  • 12
    • 0017722619 scopus 로고
    • Distributed systems: Towards a formal approach
    • [LeL77] B. Gilchrist, editor, North-Holland
    • [LeL77] G. LeLann. Distributed systems: Towards a formal approach. In B. Gilchrist, editor, Information processing'77, pages 155-160. North-Holland, 1977.
    • (1977) Information Processing'77 , pp. 155-160
    • Lelann, G.1
  • 13
    • 0008721437 scopus 로고    scopus 로고
    • Distributed enumeration
    • [Maz97]
    • [Maz97] A. Mazurkiewicz. Distributed enumeration. Inf. Processing Letters, 61:233-239, 1997.
    • (1997) Inf. Processing Letters , vol.61 , pp. 233-239
    • Mazurkiewicz, A.1
  • 14
    • 0004499550 scopus 로고
    • Intelligent graphs
    • [RFH72] R. Read, editor, Academic Press (New York)
    • [RFH72] P. Rosenstiehl, J.-R. Fiksel, and A. Holliger. Intelligent graphs. In R. Read, editor, Graph theory and computing, pages 219-265. Academic Press (New York), 1972.
    • (1972) Graph Theory and Computing , pp. 219-265
    • Rosenstiehl, P.1    Fiksel, J.-R.2    Holliger, A.3
  • 16
    • 0029752472 scopus 로고    scopus 로고
    • Computing on anonymous networks: Part i - Characterizing the solvable cases
    • [YK96]
    • [YK96] M. Yamashita and T. Kameda. Computing on anonymous networks: Part i - characterizing the solvable cases. IEEE Transactions on parallel and distributed systems, 7(1):69-89, 1996.
    • (1996) IEEE Transactions on Parallel and Distributed Systems , vol.7 , Issue.1 , pp. 69-89
    • Yamashita, M.1    Kameda, T.2


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