Graph Theory and Algorithmic Applications: Theoretical Developments
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: 15 September 2024 | Viewed by 153
Special Issue Editor
Special Issue Information
Dear Colleagues,
The algorithmic application of graph structure theory is not at all unexpected: as we learn more about what makes a graph "complex", we learn more about the computational complexity of graph-based problems. This connection is perhaps best exemplified by the seminal Graph Minors Project of Robertson and Seymour. Graph parameters, such as pathwidth and treewidth, developed in the Graph Minors project have provided efficient algorithms for many problems pertaining to large classes of graphs.
The algorithmic success of structure-based parameters such as treewidth encouraged many further advancements in this area, including the following:
- The development of algorithmic meta-theorems inspired by Courcelle to uniformly extend these efficient algorithms to large classes of problems.
- An increased interest in multi-dimensional complexity analysis with the development of parameterized algorithms.
- The development of similar, algorithmically beneficial graph parameters such as rank-width, twin-width, and DAG-width.
In this Special Issue, we invite contributions that explore the algorithmic benefits arising from developments in graph theory. Topics of interest include, but are not limited to, the following:
- Exact, parameterized, or classical algorithms for graph problems.
- Novel, algorithmically interesting, graph parameters.
- Graph-based algorithmic meta-theorems.
- Any of the above topics applied to other classes of graphs such as random graphs, directed graphs, and/or hypergraphs.
Dr. Paul Hunter
Guest Editor
Manuscript Submission Information
Manuscripts should be submitted online at mdpi.longhoe.net 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
- graph theory
- algorithms
- graph parameters
- treewidth
- pathwidth
- parameterized algorithms
- meta-theorems
- directed graphs
- hypergraphs
