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

We show that an old but not well-known lower bound for the crossing number of a graph
yields short proofs for a number of bounds in discrete plane geometry which were …

Computing a crossing minimum drawing of a given planar graph G augmented by an
additional edge e where all crossings involve e, has been a long standing open problem in …

Given a finite, undirected, simple graph G, we are concerned with operations on G that
transform it into a planar graph. We give a survey of results about such operations and …

We study the multi-layer crossing minimization problem from a polyhedral point of view. After
the introduction of an integer programming formulation of the multi-layer crossing …

An abstract topological graph (briefly an AT-graph) is a pair A=(G,R) where G=(V, E) is a
graph and R⊆E\choose2 is a set of pairs of its edges. An AT-graph A is simply realizable if …

62] Turan, P., A note of welcome, J. Graph Theory 1 (1977) 7-9. 63] Dambitis, J., An
algorithm for superimposing a nonplanar graph onto the plane with nearly minimal number …

Необходимость разработки методов и средств поддержки визуальной обработки
иерархических графовых моделей вызвана их широким применением в различных …

9. Conclusion The crossing number of a graph G is the smallest number of pairwise
crossings of edges among all drawings of G in the plane. In the last decade, there has been …

The visualization of conceptual structures is a key component of support tools for complex
applications in science and engineering. Foremost among the visual representations used …