Skip to main navigation Skip to search Skip to main content

Max-minimum algorithm for trust transitivity in trustworthy networks

  • Yixiang Chen*
  • , Tian Ming Bu
  • , Min Zhang
  • , Hong Zhu
  • *Corresponding author for this work
  • East China Normal University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original languageEnglish
Title of host publicationProceedings - 2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2009
PublisherIEEE Computer Society
Pages62-64
Number of pages3
ISBN (Print)9780769538013
DOIs
StatePublished - 2009
Event 8th IEEE/WIC/ACM International Conference on Web Intelligence, WI 2009 - Milano, Italy
Duration: 15 Sep 2009 → 18 Sep 2009

Publication series

NameProceedings - 2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2009
Volume3

Conference

Conference 8th IEEE/WIC/ACM International Conference on Web Intelligence, WI 2009
Country/TerritoryItaly
CityMilano
Period15/09/09 → 18/09/09

Keywords

  • Max-min algorithm
  • Trustworthy degree

Fingerprint

Dive into the research topics of 'Max-minimum algorithm for trust transitivity in trustworthy networks'. Together they form a unique fingerprint.

Cite this