Abstract
This paper describes a method for the detection of properties of general graphs in an environment in which each node can be considered an autonomous processor, interacting with its neighbors by passing messages.

This publication has 3 references indexed in Scilit: