Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

Книга содержит систематическое и полное изложение фундаментальных основ
современных компьютерных технологий, связанных с применением теории графов …

We consider the problem of simultaneous embedding of planar graphs. There are two
variants of this problem, one in which the mapping between the vertices of the two graphs is …

A queue layout of a graph consists of a total order of the vertices, and a partition of the edges
into queues, such that no two edges in the same queue are nested. The minimum number of …

Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with
pointed vertices (incident to an angle larger than p). In this paper we prove that the opposite …

Graph drawing techniques have been developed in the last few years with the purpose of
producing esthetically pleasing node-link layouts. Recently, the employment of differentiable …

Readability criteria, such as distance or neighborhood preservation, are often used to
optimize node-link representations of graphs to enable the comprehension of the underlying …

This paper investigates the following question: Given a grid ϕ, where ϕ is a proper subset of
the integer 2D or 3D grid, which graphs admit straight-line crossing-free drawings with …

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most
once. In general, 1-planar graphs do not admit straight-line drawings. We show that every 3 …

A\emphk-stack layout (respectively,\emphk-queuelayout) of a graph consists of a total order
of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges …