Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 408148, 10 pages
Research Article

The Most Trustworthy Path Selection in Online Social Networks

School of Information Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China

Received 22 June 2013; Accepted 19 September 2013

Academic Editor: Miguel A. F. Sanjuán

Copyright © 2013 Lianggui Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


In online social networks, it is crucial for a service consumer to find the most trustworthy path to a target service provider from numerous social trust paths between them. The selection of the most trustworthy path (namely, optimal social trust path (OSTP)) with multiple end-to-end quality of trust (QoT) constraints has been proved to be NP-Complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. However, existing solutions cannot guarantee the efficiency of searching; that is, they can hardly avoid obtaining partial optimal solutions during searching process. Quantum annealing uses delocalization and tunneling to avoid falling into local minima without sacrificing execution time. It has been proved to be a promising way to many optimization problems in recently published literature. In this paper, for the first time, QA based OSTP algorithm (QA_OSTP) is applied to the selection of the most trustworthy path. The experiment results show that QA based algorithm has better performance than its heuristic opponents.