@inproceedings{bdcdde4f4cb442309839a3dbacdadea1,
title = "Max-minimum algorithm for trust transitivity in trustworthy networks",
abstract = "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.",
keywords = "Max-min algorithm, Trustworthy degree",
author = "Yixiang Chen and Bu, \{Tian Ming\} and Min Zhang and Hong Zhu",
year = "2009",
doi = "10.1109/WI-IAT.2009.231",
language = "英语",
isbn = "9780769538013",
series = "Proceedings - 2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2009",
pages = "62--64",
booktitle = "Proceedings - 2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2009",
note = "2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2009 ; Conference date: 15-09-2009 Through 18-09-2009",
}