6 research outputs found
Untangling polygons and graphs
Untangling is a process in which some vertices of a planar graph are moved to
obtain a straight-line plane drawing. The aim is to move as few vertices as
possible. We present an algorithm that untangles the cycle graph C_n while
keeping at least \Omega(n^{2/3}) vertices fixed. For any graph G, we also
present an upper bound on the number of fixed vertices in the worst case. The
bound is a function of the number of vertices, maximum degree and diameter of
G. One of its consequences is the upper bound O((n log n)^{2/3}) for all
3-vertex-connected planar graphs.Comment: 11 pages, 3 figure
Untangling Circular Drawings: Algorithms and Complexity
We consider the problem of untangling a given (non-planar) straight-line
circular drawing of an outerplanar graph into a planar
straight-line circular drawing by shifting a minimum number of vertices to a
new position on the circle. For an outerplanar graph , it is clear that such
a crossing-free circular drawing always exists and we define the circular
shifting number shift as the minimum number of vertices that are
required to be shifted in order to resolve all crossings of . We show
that the problem Circular Untangling, asking whether shift
for a given integer , is NP-complete. For -vertex outerplanar graphs, we
obtain a tight upper bound of shift. Based on these results we study Circular Untangling for almost-planar
circular drawings, in which a single edge is involved in all the crossings. In
this case, we provide a tight upper bound shift and present a constructive polynomial-time algorithm to
compute the circular shifting number of almost-planar drawings.Comment: 20 pages, 10 figures, extended version of ISAAC 2021 pape
Moving Vertices to Make Drawings Plane
A straight-line drawing of a planar graph need not be plane, but
can be made so by moving some of the vertices. Let shift denote the
minimum number of vertices that need to be moved to turn into a plane
drawing of . We show that shift is NP-hard to compute and to
approximate, and we give explicit bounds on shift when is a
tree or a general planar graph. Our hardness results extend to
1BendPointSetEmbeddability, a well-known graph-drawing problem.Comment: This paper has been merged with http://arxiv.org/abs/0709.017
Recommended from our members
Graph Theory
Graph theory is a rapidly developing area of mathematics. Recent years have seen the development of deep theories, and the increasing importance of methods from other parts of mathematics. The workshop on Graph Theory brought together together a broad range of researchers to discuss some of the major new developments. There were three central themes, each of which has seen striking recent progress: the structure of graphs with forbidden subgraphs; graph minor theory; and applications of the entropy compression method. The workshop featured major talks on current work in these areas, as well as presentations of recent breakthroughs and connections to other areas. There was a particularly exciting selection of longer talks, including presentations on the structure of graphs with forbidden induced subgraphs, embedding simply connected 2-complexes in 3-space, and an announcement of the solution of the well-known Oberwolfach Problem