Highly Influenced

# On the np-completeness of certain network testing problems

@article{Even1984OnTN, title={On the np-completeness of certain network testing problems}, author={Shimon Even and Oded Goldreich and Shlomo Moran and Po Tong}, journal={Networks}, year={1984}, volume={14}, pages={1-24} }

- Published 1984 in Networks
DOI:10.1002/net.3230140102

Let G ( V , E) be an undirected graph which describes the structure of a communication network. During the maintenance period every line must be tested in each of the two possible directions. A line is tested by assigning one of its endpoints t o be a transmitter, the other to be a receiver, and sending a message from the transmitter t o the receiver through the line. We define several different models for communication networks, all subject to the two following axioms: a vertex cannot act as a… CONTINUE READING

Highly Cited

This paper has 111 citations. REVIEW CITATIONS

#### 15 Figures & Tables

#### Topics

#### Statistics

Citations per Year

#### 111 Citations

Semantic Scholar estimates that this publication has

**111**citations based on the available data.See our **FAQ** for additional information.