Algorithms for Hard Graph Problems
A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Randomized, Online, and Approximation Algorithms".
Deadline for manuscript submissions: closed (31 March 2021) | Viewed by 3744
Special Issue Editor
Special Issue Information
Dear Colleagues,
Graphs have been used for a long time in many different areas of engineering and science. Since many interesting problems on graphs are hard, several approaches for solving hard problems have been applied to these problems. These include parameterized algorithms, exponential time algorithms, approximation algorithms, randomized algorithms, heuristic algorithms, and algorithms for special graph classes. For this Special Issue on “Algorithms for Hard Graph Problems”, we welcome papers presenting original research concerned with all fields of solving hard graph problems. Works on undirected graphs as well as works on directed graphs are welcome.
Dr. Frank Gurski
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
- parameterized algorithms
- exponential time algorithms
- approximation algorithms
- randomized algorithms
- heuristic algorithms
- algorithms for special graph classes
- width parameters
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 polices can be found here.
