Special Issue "Graph Partitioning: Theory, Engineering, and Applications"

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (30 June 2019).

Special Issue Editors

Guest Editor
Dr. Christian Schulz

Faculty of Computer Science, Research Group Theory and Applications of Algorithms, University of Vienna, 1010 Vienna, Austria
Website | E-Mail
Interests: graph partitioning; algorithm engineering; parallel algorithms; big data
Guest Editor
Dr. Darren Strash

Department of Computer Science, Hamilton College, Clinton, NY 13323, USA
Website | E-Mail
Interests: theoretical computer science; combinatorial optimization; algorithm engineering; geometric and graph algorithms

Special Issue Information

Dear Colleagues,

We invite you to submit your latest research in the area of graph partitioning to this Special Issue, Graph Partitioning: Theory, Engineering, and Applications. All facets of graph partitioning will be considered, including shared-memory parallel and distributed algorithms, streaming algorithms, exact algorithms, approximation algorithms, local search, genetic algorithms, metaheuristics, hardness results, parameterized algorithms, variations in objective functions, and alternate partitioning primitives (such as edge partitioning) or process mapping algorithms. High-quality papers are solicited to address both the theoretical and practical issues of graph partitioning. Submissions on graph partitioning’s impact on existing applications, and the introduction of new applications with experiments are highly encouraged.

Dr. Christian Schulz
Dr. Darren Strash
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 papers will be 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 1000 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 partitioning
  • edge partitioning
  • exact algorithms
  • approximate algorithms
  • partitioning heuristics and metaheuristics
  • evolutionary algorithms
  • complexity of partitioning algorithms
  • algorithms for multi-objective partitioning
  • partitioning algorithms for distributed processing
  • engineering efficient graph partitioners
  • shared-memory algorithms
  • distributed algorithms

Published Papers

There is no accepted submissions to this special issue at this moment.
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top