메뉴 건너뛰기




Volumn 7, Issue 1, 1996, Pages 90-96

Computing on anonymous networks: Part II - Decision and membership problems

Author keywords

Anonymous network; Computability; Distributed computing; Edge election; Leader election; NP completeness; Spanning tree construction; Topology recognition

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DECISION THEORY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MEMBERSHIP FUNCTIONS; PROBLEM SOLVING; TOPOLOGY;

EID: 0029755514     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.481600     Document Type: Article
Times cited : (36)

References (8)
  • 2
    • 84944076702 scopus 로고
    • Local and global properties in networks of processors
    • D. Angluin, "Local and global properties in networks of processors," Frac. 12th ACM Symp. Theory of Computing, pp. 82-93, 1980.
    • (1980) Frac. 12th ACM Symp. Theory of Computing , pp. 82-93
    • Angluin, D.1
  • 4
    • 0003780715 scopus 로고
    • Reading, Mass.: Addison-Wesley
    • A.F. Harary, Graph Theory. Reading, Mass.: Addison-Wesley, 1969.
    • (1969) Graph Theory
    • Harary, A.F.1
  • 5
    • 85064850083 scopus 로고
    • An O(√|V| × |E|) algorithm for finding maximum matching in general graphs
    • Syracuse, N.Y.
    • S. Micali and V.V. Vazirani, "An O(√|V| × |E|) algorithm for finding maximum matching in general graphs," Proc. 21st IEEE Symp. Foundations of Computer Science, pp. 17-27, Syracuse, N.Y., 1980.
    • (1980) Proc. 21st IEEE Symp. Foundations of Computer Science , pp. 17-27
    • Micali, S.1    Vazirani, V.V.2
  • 6
    • 0001550949 scopus 로고
    • Die Theorie der regulären Graphs
    • J. Petersen, "Die Theorie der regulären Graphs," Acta Mathematica, vol. 15, pp. 193-220, 1891.
    • (1891) Acta Mathematica , vol.15 , pp. 193-220
    • Petersen, J.1


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