Advances in Graph Computing: Algorithms and Applications

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "E1: Mathematics and Computer Science".

Deadline for manuscript submissions: 31 December 2026 | Viewed by 864

Editors


E-Mail Website
Guest Editor
School of Cyber Science and Technology, Beihang University, Beijing, China
Interests: graph representation learning; LLM; multimodal learning; self-supervised learning; theory-driven efficient learning algorithms

E-Mail Website
Guest Editor
Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
Interests: big data management and analysis; social network analysis; open-source intelligence analysis

E-Mail Website
Guest Editor
Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
Interests: big data; artificial intelligence; data security
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Graph computing plays an increasingly important role in the development of modern data science and scientific computing. It aims to study the mathematical foundations, algorithmic principles, and practical implementations of computation over graph-structured data, enabling effective analysis, learning, optimization, and inference in complex systems. Applications and examples of graph-based models and methods are ubiquitous across a diverse set of areas, including network science, knowledge graphs, recommendation, communication networks, biological and chemical networks, transportation systems, and social and information networks. The growing demand for scalable and reliable methods for understanding relational and structured data, as well as their deployment in real-world systems, is driving rapid advances in graph computing.

In this Special Issue, we aim to present recent developments in the theory and applications of graph computing, with a special emphasis on graph algorithms and combinatorial optimization, spectral and algebraic methods for graph analysis, self-supervised learning on graphs, scalable and distributed graph processing, graph sampling, dynamic and heterogeneous graphs, and graph representation learning (including graph neural networks), as well as robustness, interpretability, and trustworthy graph analytics.

Dr. Rong Yin
Dr. Can Ma
Prof. Dr. Weiping Wang
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. Mathematics is an international peer-reviewed open access semimonthly 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 2600 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 algorithms and combinatorial optimization
  • spectral, algebraic, and topological methods for graph analysis
  • scalable and distributed graph processing
  • graph representation learning and graph neural networks
  • applications of graph computing in the natural sciences (e.g., biology, chemistry)
  • applications of graph computing in industry (e.g., advertising, recommender systems)
  • applications of graph computing in the social sciences (e.g., social networks, information diffusion)

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 (1 paper)

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

Research

23 pages, 6864 KB  
Article
Disentangled Graph Representation Based on Prototype Subgraph Neural Network
by Baosheng Yang, Jingshang Yang, Lixiang Xu and Yuanyan Tang
Mathematics 2026, 14(11), 1915; https://doi.org/10.3390/math14111915 - 1 Jun 2026
Viewed by 492
Abstract
While graph representation learning methods have been successfully applied to various graph data mining tasks, they typically couple graph information into an unstructured holistic representation. This makes it difficult to explicitly identify substructures with specific functionalities within the graph and lacks the ability [...] Read more.
While graph representation learning methods have been successfully applied to various graph data mining tasks, they typically couple graph information into an unstructured holistic representation. This makes it difficult to explicitly identify substructures with specific functionalities within the graph and lacks the ability to mine discriminative prototype structures that can be shared across graphs. To address these challenges, this paper proposes Prototype Subgraph Disentangled Graph Neural Network (PSDGNN). It explicitly disentangles node features into multiple independent latent factor groups through latent factor decomposition and prototype alignment mechanisms. A subgraph generator then converts these factors into factor subgraphs to model latent semantic substructures. Furthermore, learnable prototype subgraphs are introduced to represent foundational structural patterns shared across graphs. Through similarity matching and mutual information minimization objectives, the model aligns factor subgraphs with corresponding prototypes in structural semantics. Experimental results demonstrate superior performance over existing baseline methods across seven public datasets. The model provides intuitive, structured explanations for classification decisions through visualizable factor subgraphs and prototype subgraphs, significantly enhancing interpretability and generalization capabilities. Full article
(This article belongs to the Special Issue Advances in Graph Computing: Algorithms and Applications)
Show Figures

Figure 1

Back to TopTop