2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing 2013
DOI: 10.1109/3pgcic.2013.58
|View full text |Cite
|
Sign up to set email alerts
|

A Dynamic Trust Conference Algorithm for Social Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(2 citation statements)
references
References 11 publications
0
1
0
Order By: Relevance
“…Xin et al [7] proposed a dynamic trust conference algorithm for social network. When there is only one shortest path from the source node to the destination node, the trust value calculated by the algorithm in [2] will be the same as the trust value of the node which is the last but one in the chain to the destination node.…”
Section: Related Workmentioning
confidence: 99%
“…Xin et al [7] proposed a dynamic trust conference algorithm for social network. When there is only one shortest path from the source node to the destination node, the trust value calculated by the algorithm in [2] will be the same as the trust value of the node which is the last but one in the chain to the destination node.…”
Section: Related Workmentioning
confidence: 99%
“…PCDA computer cycle mode is a very effective computer management mode [1]. The implementation steps are to put forward the mission objectives at the first step, and then enter into the main process, including the implementation of tasks, task check, and effect optimization, forming the logic.…”
Section: Introductionmentioning
confidence: 99%