Topology optimization is increasingly used in lightweight designs for additive manufacturing
(AM). However, conventional optimization techniques do not fully consider manufacturing …

Computing in Nonlinear Media and Automata Collectives presents an account of new ways
to design massively parallel computing devices in advanced mathematical models, such as …

A survey of shortest path methods is presented. All the algorithms described are shown to
derive from one single prototype method, the difference between them depending only on …

В монографии систематически изложены программно реализованные алгоритмы
задач теории графов. Рассмотрены задачи упаковки, покрытия, раскраски, связности и …

In this paper, we show how to find the shortest path between given nodes of a mesh with
weighted edges. We use a cellular automaton which exhibits autowave patterns, where a …

Completely sequencing genomes is expensive, and to save costs we often analyze new
genomic data in the context of a reference genome. This approach distorts our image of the …

Shortest path (SP) problem is a classical problem in computer science. Many Physarum-
inspired algorithms suffer from a low converge speed. To solve this problem, a bayesian …

Abstract Let G=(V, E) be a simple, connected graph. One is often interested in a short path
between two vertices u, v∈ V. We propose a spectral algorithm: construct the function ϕ: V→ …

Abstract Properties of efficient points on a network are given. They are then used to devise
(i) a linear algorithm for efficient points on a tree,(ii) on O (m log n) algorithm for the set of …

A labelling algorithm is proposed to determine the shortest signed paths between one vertex
and all others in a weighted signed graph. It can be implemented to take O (m log log D/d) …