A k-page book drawing of a graph G=(V, E) consists of a linear ordering of its vertices along
a spine and an assignment of each edge to one of the k pages, which are half-planes …

Graph layout problems refer to a family of optimization problems with relevant applications in
VLSI design, information retrieval, numerical analysis, computational biology, or graph …

Visualization of biological mechanisms by means of pathway graphs is necessary to better
understand the often complex underlying system. Manual layout of such pathways or maps …

The K-page crossing number minimization problem (KPMP) is to determine the minimum
number of edge crossings over all K-page book drawings of a graph G with the vertices …

In this paper, we investigate the use of artificial neural networks in order to solve the Shortest
Common Superstring Problem. Concretely, the neural network used in this work is based on …

Introduction. A book with k pages consists of a line (the spine) and k halfplanes (the pages),
each with the spine as boundary. In a k-page book drawing of a graph the vertices lie on the …