Complex Network Theory and Applications

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Combinatorial Optimization, Graph, and Network Algorithms".

Deadline for manuscript submissions: 31 July 2027 | Viewed by 126

Editors


E-Mail Website
Guest Editor
School of Mathematics and Statistics, Xiamen University of Technology, Xiamen 361024, China
Interests: graph theory; fault tolerance of networks; network optimization

E-Mail Website
Guest Editor
Department of Communications and Computer Engineering, Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan
Interests: graph algorithms; bioinformatics; computational complexity; data structures
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Graph theory serves as the fundamental mathematical backbone for modeling interconnected systems across all modern scientific and engineering disciplines, while advanced network algorithms act as the core computational engine to mine structural characteristics, optimize operational performance, and resolve complex decision-making problems in large-scale networked environments. In the era of big data, ubiquitous computing and artificial intelligence, real-world complex networks have presented unprecedented challenges: massive network scale, dynamic topological evolution, multilayer coupled structures, and uncertain edge weights, as well as stringent requirements for low-latency computation and high network resilience. Traditional static graph theories and classic polynomial-time network algorithms gradually fail to adapt to the iterative upgrading demands of communication networks, intelligent transportation systems, social networks, biomolecular interaction networks, power grid systems and graph neural network-driven intelligent analysis scenarios.

Against this research backdrop, this Special Issue, entitled “Complex Network Theory and Applications”,  aims to bridge cutting-edge theoretical innovations in graph mathematics and practical algorithmic breakthroughs for complex network systems. It gathers original research findings and state-of-the-art review articles from worldwide scholars focusing on graph structural optimization, combinatorial graph problems, dynamic network computing, distributed network algorithms, graph learning algorithms and interdisciplinary network applications. This Special Issue provides a high-standard academic platform to share novel methodologies, verify technical performances, and discuss open challenges in graph and network research communities.

Dr. Litao Guo
Dr. Jesper Jansson
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 submissions that pass pre-check are 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 250 words) can be sent to the Editorial Office for assessment.

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-anonymized 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 1800 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

  • fundamental graph theory
  • classic advanced network algorithms
  • dynamic and distributed network algorithms
  • graph learning and intelligent network algorithms
  • interdisciplinary network applications.

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers

This special issue is now open for submission.
Back to TopTop