Authors/Contributors

H. F. Mattson Jr

Document Type

Report

Date

2-1992

Embargo Period

5-7-2012

Keywords

networks

Language

English

Disciplines

Computer Sciences

Description/Abstract

To find broken links in networks we use the cut-set space. Information on which nodes can talk, or not, to which other nodes allows reduction of the problem to that of decoding the cut-set code of a graph. Special classes of such codes are known to have polynomial-time decoding algorithms. We present a simple algorithm to achieve the reduction and apply it in two examples.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-92-04

Author later published: Mattson, H. F. (1992). Fault-detection in networks. Discrete Mathematics, 106-107, 343-352. Elsevier . doi:10.1016/0012-365X(92)90564-V

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.