Special Issue "Algorithms for complex network and its applications"

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Analysis of Algorithms and Complexity Theory".

Deadline for manuscript submissions: closed (15 September 2020).

Special Issue Editors

Dr. Joanna Józefowska
Website
Guest Editor
Laboratory of Operations Research and Artificial Intelligence, Institute of Computing Science, Poznań University of Technology, 60-195 Poznań, Poland
Interests: algorithms and complexity; combinatorial optimization; graph and network algorithms; operations research; artificial intelligence
Dr. Yilun Shang
Website
Guest Editor
Computer and Information Sciences, Northumbria University, Newcastle upon Tyne NE1 8ST, UK
Interests: mathematics; complex systems; networks; computer science; physics

Special Issue Information

Network science has become an important and growing field in today’s society as many sectors using information technology, wireless communications, big data, and the Internet of Things are formed by a large number of interacting components and underpinned with self-organizing principles. The need to understand algorithms underlying complex networks, large-scale structures, and the dynamics governing them is imperative. In this Special Issue we invite authors to submit high-quality papers from both theoretical/mathematical and practical points of view addressing algorithm-related problems arising from complex networks. Some of the topics of interest include (but are not limited to):

  • Algorithms for random structure
  • Combinatorial algorithms
  • Complex network analysis
  • Network visualization
  • Community detection algorithms
  • Web analytics
  • Artificial intelligence
  • Sensor networks
  • Social network analysis
  • Biological network analysis
  • Algorithms for wireless networks
  • Simulation for complex networks
  • Network synchronization algorithms
  • Distributed algorithms
  • Optimization algorithms
Dr. Joanna Józefowska
Dr. Yilun Shang
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Graph algorithm
  • Social network analysis
  • Wireless network algorithm
  • Community detection algorithm
  • Information network algorithm
  • Network simulation
  • Distributed algorithm

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

Open AccessArticle
Identifying Influential Nodes of Complex Networks Based on Trust-Value
Algorithms 2020, 13(11), 280; https://doi.org/10.3390/a13110280 - 05 Nov 2020
Abstract
The real world contains many kinds of complex network. Using influence nodes in complex networks can promote or inhibit the spread of information. Identifying influential nodes has become a hot topic around the world. Most of the existing algorithms used for influential node [...] Read more.
The real world contains many kinds of complex network. Using influence nodes in complex networks can promote or inhibit the spread of information. Identifying influential nodes has become a hot topic around the world. Most of the existing algorithms used for influential node identification are based on the structure of the network such as the degree of the nodes. However, the attribute information of nodes also affects the ranking of nodes’ influence. In this paper, we consider both the attribute information between nodes and the structure of networks. Therefore, the similarity ratio, based on attribute information, and the degree ratio, based on structure derived from trust-value, are proposed. The trust–PageRank (TPR) algorithm is proposed to identify influential nodes in complex networks. Finally, several real networks from different fields are selected for experiments. Compared with some existing algorithms, the results suggest that TPR more rationally and effectively identifies the influential nodes in networks. Full article
(This article belongs to the Special Issue Algorithms for complex network and its applications)
Show Figures

Figure 1

Back to TopTop