You are currently viewing a new version of our website. To view the old version click .

Algorithms, Volume 12, Issue 9

September 2019 - 24 articles

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Cover Story: The physical movement of multibody systems on an atomistic level, taking place at the femtosecond time scale, is at the core of quantum molecular dynamics simulations. The Los Alamos National Laboratory explores novel approaches for the simulation of such systems which make use of a special type of graph partitioning to efficiently parallelize computations. For this, the density matrix of a physical system is represented as a graph where atomic orbitals become vertices and nonzero interactions become edges (left figure). After partitioning (right figure), the parts correspond to the divisions of the molecule. The tailored graph partitioning scheme ensures that running the molecular dynamics simulations independently on the parts and reassembling all individual solutions incurs no loss of accuracy. View this paper.

Articles (24)

  • Article
  • Open Access
37 Citations
9,427 Views
28 Pages

18 September 2019

Algorithmic decision-making has become ubiquitous in our societal and economic lives. With more and more decisions being delegated to algorithms, we have also encountered increasing evidence of ethical issues with respect to biases and lack of fairne...

  • Feature Paper
  • Article
  • Open Access
5 Citations
5,751 Views
26 Pages

17 September 2019

Solvers for partial differential equations (PDEs) are one of the cornerstones of computational science. For large problems, they involve huge amounts of data that need to be stored and transmitted on all levels of the memory hierarchy. Often, bandwid...

  • Article
  • Open Access
1 Citations
4,953 Views
15 Pages

17 September 2019

We present a mapping between rooted tree decompositions and node separator based multilevel graph partitions. Significant research into both tree decompositions and graph partitions exists. We hope that our result allows for an easier knowledge trans...

  • Article
  • Open Access
17 Citations
5,657 Views
20 Pages

Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies

  • Lars Gottesbüren,
  • Michael Hamann,
  • Tim Niklas Uhl and
  • Dorothea Wagner

16 September 2019

Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on computing a nested dissection order by recursively dividing the road net...

  • Article
  • Open Access
7 Citations
3,413 Views
9 Pages

16 September 2019

Recently, magnetorheological elastomer (MRE) has been paid increasingly attention for vibration mitigation devices with the benefits of low power cost, fail safe performances, and fast responses. To make full use of the striking advantages of MRE dev...

  • Article
  • Open Access
7 Citations
3,648 Views
24 Pages

Unsteady State Lightweight Iris Certification Based on Multi-Algorithm Parallel Integration

  • Liu Shuai,
  • Liu Yuanning,
  • Zhu Xiaodong,
  • Zhang Kuo,
  • Ding Tong,
  • Li Xinlong and
  • Wang Chaoqun

12 September 2019

Aimed at the one-to-one certification problem of unsteady state iris at different shooting times, a multi-algorithm parallel integration general model structure is proposed in this paper. The iris in the lightweight constrained state affected by defo...

  • Article
  • Open Access
1 Citations
3,483 Views
23 Pages

11 September 2019

The development of robotic applications for agricultural environments has several problems which are not present in the robotic systems used for indoor environments. Some of these problems can be solved with an efficient navigation system. In this pa...

  • Article
  • Open Access
3 Citations
5,733 Views
20 Pages

10 September 2019

The interactive, web-based point-and-click application presented in this article, allows anonymizing data without any knowledge in a programming language. Anonymization in data mining, but creating safe, anonymized data is by no means a trivial task....

  • Article
  • Open Access
14 Citations
5,589 Views
30 Pages

10 September 2019

The information bottleneck method is a generic clustering framework from the field of machine learning which allows compressing an observed quantity while retaining as much of the mutual information it shares with the quantity of primary relevance as...

  • Feature Paper
  • Article
  • Open Access
6 Citations
4,712 Views
28 Pages

9 September 2019

We present a list of parameterized problems together with a complexity classification of whether they allow a fixed-parameter tractable reduction to SAT or not. These problems are parameterized versions of problems whose complexity lies at the second...

of 3

Get Alerted

Add your email address to receive forthcoming issues of this journal.

XFacebookLinkedIn
Algorithms - ISSN 1999-4893Creative Common CC BY license