Graph and Hypergraph Algorithms 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 October 2026 | Viewed by 1640
Special Issue Editor
Special Issue Information
Dear Colleagues,
Graphs and hypergraphs are abstract structures able to capture a wide variety of real-world applications and can be used to solve problems arising from diverse fields ranging from artificial intelligence to network flows and from linear algebra to integer optimization problems, to cite only a few.
The aim of this Special Issue is to collect valuable, original and high quality papers on hypergraph and graph algorithms and applications.
Given the immense number of applications and the diverse fields in which graphs and hypergraphs are studied and applied, the scope of this Special Issue is very broad. It includes virtually any applicative field, apart from the traditional field of algorithms and data structure.
Topics of interest include but are not limited to the following, in which graphs or hypergraphs are the main tool for the problem or the application:
- Optimization problems;
- Quantum computing;
- Computational complexity analysis;
- Exact and approximation (hyper)graph algorithms;
- Database systems;
- Social Network Analysis;
- Routing and shortest path;
- Recommendation systems;
- Graph neural networks.
Dr. Mauro Mezzini
Guest Editor
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 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 1600 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
- applications of hypergraphs and graphs
- fast algorithms for special hypergraph and graph classes
- design and analysis of hypergraph and graph algorithms
- exact hypergraph and graph algorithms
- approximation hypergraph and graph algorithms
- computational complexity
- fixed-parameter tractability
- pattern matching in graphs
- interconnection networks
- social networks
- telecommunication networks
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.
- e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.
Further information on MDPI's Special Issue policies can be found here.
