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

Masafumi Yamashita, Tsunehiko Kameda

Research output: Contribution to journalArticle

34 Citations (Scopus)

Abstract

In anonymous networks, the processors do not have identity numbers. In Part I of this paper, we characterized the classes of networks on which some representative distributed computation problems are solvable under different conditions. A new graph property called symmetricity played a central role in our analysis of anonymous networks. In Part II, we turn our attention to the computational complexity issues. We first discuss the complexity of determining the symmetricity of a given graph, and then that of testing membership in each of the 16 classes of anonymous networks defined in Part I. It turns out that, depending on the class, the complexity varies from P-time to NP-complete or co-NP-complete.

Original languageEnglish
Pages (from-to)90-96
Number of pages7
JournalIEEE Transactions on Parallel and Distributed Systems
Volume7
Issue number1
DOIs
Publication statusPublished - Dec 1 1996

Fingerprint

Computational complexity
Testing

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Computing on anonymous networks : Part II - Decision and membership problems. / Yamashita, Masafumi; Kameda, Tsunehiko.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 1, 01.12.1996, p. 90-96.

Research output: Contribution to journalArticle

@article{b18480539fff4f58be8583bad9ad0a2a,
title = "Computing on anonymous networks: Part II - Decision and membership problems",
abstract = "In anonymous networks, the processors do not have identity numbers. In Part I of this paper, we characterized the classes of networks on which some representative distributed computation problems are solvable under different conditions. A new graph property called symmetricity played a central role in our analysis of anonymous networks. In Part II, we turn our attention to the computational complexity issues. We first discuss the complexity of determining the symmetricity of a given graph, and then that of testing membership in each of the 16 classes of anonymous networks defined in Part I. It turns out that, depending on the class, the complexity varies from P-time to NP-complete or co-NP-complete.",
author = "Masafumi Yamashita and Tsunehiko Kameda",
year = "1996",
month = "12",
day = "1",
doi = "10.1109/71.481600",
language = "English",
volume = "7",
pages = "90--96",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "1",

}

TY - JOUR

T1 - Computing on anonymous networks

T2 - Part II - Decision and membership problems

AU - Yamashita, Masafumi

AU - Kameda, Tsunehiko

PY - 1996/12/1

Y1 - 1996/12/1

N2 - In anonymous networks, the processors do not have identity numbers. In Part I of this paper, we characterized the classes of networks on which some representative distributed computation problems are solvable under different conditions. A new graph property called symmetricity played a central role in our analysis of anonymous networks. In Part II, we turn our attention to the computational complexity issues. We first discuss the complexity of determining the symmetricity of a given graph, and then that of testing membership in each of the 16 classes of anonymous networks defined in Part I. It turns out that, depending on the class, the complexity varies from P-time to NP-complete or co-NP-complete.

AB - In anonymous networks, the processors do not have identity numbers. In Part I of this paper, we characterized the classes of networks on which some representative distributed computation problems are solvable under different conditions. A new graph property called symmetricity played a central role in our analysis of anonymous networks. In Part II, we turn our attention to the computational complexity issues. We first discuss the complexity of determining the symmetricity of a given graph, and then that of testing membership in each of the 16 classes of anonymous networks defined in Part I. It turns out that, depending on the class, the complexity varies from P-time to NP-complete or co-NP-complete.

UR - http://www.scopus.com/inward/record.url?scp=0029755514&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029755514&partnerID=8YFLogxK

U2 - 10.1109/71.481600

DO - 10.1109/71.481600

M3 - Article

AN - SCOPUS:0029755514

VL - 7

SP - 90

EP - 96

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 1

ER -