Max-Minimum Algorithm for Trust Transitivity in Trustworthy Networks

In this paper, we present a new measuring method of computing the transitive trustworthy degree between two different nodes. In this measuring method, the transitive trust degree of $u$ and $v$ along a path is measured in terms of the minimum weight of all edges on the path. For parallel paths between $u$ and $v$, the transitive trust degree is defined as the maximum among the transitive degrees of all these paths. We prove that the measuring method can be done in polynomial time.