메뉴 건너뛰기




Volumn 37, Issue 2, 2004, Pages 249-293

Characterizations of Classes of Graphs Recognizable by Local Computations

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; GRAPH THEORY; MATHEMATICAL INSTRUMENTS; PROBLEM SOLVING; SET THEORY;

EID: 1642586158     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-003-1062-1     Document Type: Article
Times cited : (23)

References (34)
  • 3
    • 0022862841 scopus 로고
    • Simulation of large networks on smaller networks
    • [BL]
    • [BL] H.-L. Bodlaender and J. Van Leeuwen. Simulation of large networks on smaller networks. Information and Control, 71:143-180, 1986.
    • (1986) Information and Control , vol.71 , pp. 143-180
    • Bodlaender, H.-L.1    Van Leeuwen, J.2
  • 5
    • 38149145996 scopus 로고
    • Coverings and minors: Applications to local computations in graphs
    • [CM]
    • [CM] B. Courcelle and Y. Métivier. Coverings and minors: applications to local computations in graphs. European Journal of Combinatorics, 15:127-138, 1994.
    • (1994) European Journal of Combinatorics , vol.15 , pp. 127-138
    • Courcelle, B.1    Métivier, Y.2
  • 7
    • 84875562982 scopus 로고    scopus 로고
    • Decidability questions for graph k-coverings
    • [DZ], LaBRI
    • [DZ] F. Demichelis and W. Zielonka. Decidability questions for graph k-coverings. Technical Report, LaBRI, 1996.
    • (1996) Technical Report
    • Demichelis, F.1    Zielonka, W.2
  • 8
    • 0042864376 scopus 로고
    • The Robertson-Seymour theorems: A survey of applications
    • [F]
    • [F] M. R. Fellows. The Robertson-Seymour theorems: a survey of applications. Contemporary Mathematics, 89:1-18, 1989.
    • (1989) Contemporary Mathematics , vol.89 , pp. 1-18
    • Fellows, M.R.1
  • 9
    • 0022562351 scopus 로고
    • Easy impossibility proofs for distributed consensus problems
    • [FLM]
    • [FLM] M. J. Fisher, N. A. Lynch, and M. Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1:26-29, 1986.
    • (1986) Distributed Computing , vol.1 , pp. 26-29
    • Fisher, M.J.1    Lynch, N.A.2    Merritt, M.3
  • 11
    • 0008713925 scopus 로고    scopus 로고
    • Characterization of classes of graphs recognizable by local computations with initial knowledge (extended abstract)
    • [GMI], number 11 in Proceedings in Informatics. Carleton Scientific, Ottawa
    • [GMI] E. Godard and Y. Métivier. Characterization of classes of graphs recognizable by local computations with initial knowledge (extended abstract). In SIROCCO 01-8th International Colloquium on Structural Information & Communication Complexity, number 11 in Proceedings in Informatics, pages 179-194. Carleton Scientific, Ottawa, 2001.
    • (2001) SIROCCO 01-8th International Colloquium on Structural Information & Communication Complexity , pp. 179-194
    • Godard, E.1    Métivier, Y.2
  • 12
    • 84855344139 scopus 로고    scopus 로고
    • A characterization of families of graphs in which election is possible (extended abstract)
    • [GM2]. M. Nielsen and U. Engberg, editors, number 2303 in LNCS. Springer-Verlag, Berlin
    • [GM2] E. Godard and Y. Métivier. A characterization of families of graphs in which election is possible (extended abstract). In M. Nielsen and U. Engberg, editors, Proceedings of Foundations of Software Science and Computation Structures, FOSSACS '02, number 2303 in LNCS, pages 159-171. Springer-Verlag, Berlin, 2002.
    • (2002) Proceedings of Foundations of Software Science and Computation Structures, FOSSACS '02 , pp. 159-171
    • Godard, E.1    Métivier, Y.2
  • 18
    • 0347466287 scopus 로고    scopus 로고
    • Graph relabelling systems and distributed algorithms
    • [LMS2]. H. Ehrig, H.J. Kreowski, U. Montanari, and G. Rozenberg, editors,. World Scientific, Singapore
    • [LMS2] I. Litovsky, Y. Métivier, and E. Sopena. Graph relabelling systems and distributed algorithms. In H. Ehrig, H.J. Kreowski, U. Montanari, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 3, pages 1-56. World Scientific, Singapore, 1999.
    • (1999) Handbook of Graph Grammars and Computing by Graph Transformation , vol.3 , pp. 1-56
    • Litovsky, I.1    Métivier, Y.2    Sopena, E.3
  • 19
    • 0000870945 scopus 로고
    • On the recognition of families of graphs with local computations
    • [LMZ]
    • [LMZ] I. Litovsky, Y. Métivier, and W. Zielonka. On the recognition of families of graphs with local computations. Information and Computation, 118(1):110-119, 1995.
    • (1995) Information and Computation , vol.118 , Issue.1 , pp. 110-119
    • Litovsky, I.1    Métivier, Y.2    Zielonka, W.3
  • 21
    • 85034819445 scopus 로고
    • Trace theory
    • [M2]. W. Brauer et al., editor, Petri Nets, volume 255 of LNCS,. Springer-Verlag, Berlin
    • [M2] A. Mazurkiewicz. Trace theory. In W. Brauer et al., editor, Petri Nets, Applications and Relationship to Other Models of Concurrency, volume 255 of LNCS, pages 279-324. Springer-Verlag, Berlin, 1987.
    • (1987) Applications and Relationship to Other Models of Concurrency , pp. 279-324
    • Mazurkiewicz, A.1
  • 23
    • 0013189328 scopus 로고    scopus 로고
    • About the local detection of termination of local computations in graphs
    • [MMW]. D. Krizanc and P. Widmayer, editors, Proceedings in Informatics, . Carleton Scientific, Ottawa
    • [MMW] Y. Métivier, A. Muscholl, and P.-A. Wacrenier. About the local detection of termination of local computations in graphs. In D. Krizanc and P. Widmayer, editors, SIROCCO 97-4th International Colloquium on Structural Information & Communication Complexity, Proceedings in Informatics, pages 188-200. Carleton Scientific, Ottawa, 1997.
    • (1997) SIROCCO 97-4th International Colloquium on Structural Information & Communication Complexity , pp. 188-200
    • Métivier, Y.1    Muscholl, A.2    Wacrenier, P.-A.3
  • 25
    • 0011716017 scopus 로고
    • What can be computed locally?
    • [NS]
    • [NS] M. Naor and L. Stockmeyer. What can be computed locally? SIAM Journal on Computing, 24(6):1259-1277, 1995.
    • (1995) SIAM Journal on Computing , vol.24 , Issue.6 , pp. 1259-1277
    • Naor, M.1    Stockmeyer, L.2
  • 28
    • 0004499550 scopus 로고
    • Intelligent graphs
    • [RFH]. R. Read, editor,. Academic Press, New York
    • [RFH] 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
  • 32
    • 0029752472 scopus 로고    scopus 로고
    • Computing on anonymous networks: Part I - Characterizing the solvable cases
    • [YK1]
    • [YK1] 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
  • 33
    • 0029755514 scopus 로고    scopus 로고
    • Computing on anonymous networks: Part II - Decision and membership problems
    • [YK2]
    • [YK2] M. Yamashita and T. Kameda. Computing on anonymous networks: Part II - decision and membership problems. IEEE Transactions on Parallel and Distributed Systems, 7(1):90-96, 1996.
    • (1996) IEEE Transactions on Parallel and Distributed Systems , vol.7 , Issue.1 , pp. 90-96
    • Yamashita, M.1    Kameda, T.2
  • 34
    • 0033185158 scopus 로고    scopus 로고
    • Leader election problem on networks in which processor identity numbers are not distinct
    • [YK3]
    • [YK3] M. Yamashita and T. Kameda. Leader election problem on networks in which processor identity numbers are not distinct. IEEE Transactions on Parallel and Distributed Systems, 10(9):878-887, 1999.
    • (1999) IEEE Transactions on Parallel and Distributed Systems , vol.10 , Issue.9 , pp. 878-887
    • Yamashita, M.1    Kameda, T.2


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