Titlebook: ;

針葉

Upward Planarity Testing: A Computational Studyictly monotonously increasing .-coordinates. Testing whether a graph allows such a drawing is known to be NP-complete, but there is a substantial collection of different algorithmic approaches known in literature..In this paper, we give an overview of the known algorithms, ranging from combinatorial

最初

Insubordinate

Inflamed

Morphing Planar Graph Drawings Efficientlyarity is preserved at all times. Each step of the morph moves each vertex at constant speed along a straight line. Although the existence of a morph between any two drawings was established several decades ago, only recently it has been proved that a polynomial number of steps suffices to morph any

滔滔不絕地講

Parley

A Linear-Time Algorithm for Testing Outer-1-Planaritye outer face and each edge has at most one crossing. We present a linear time algorithm to test whether a graph is outer-1-planar. The algorithm can be used to produce an outer-1-planar embedding in linear time if it exists.

流出

Straight-Line Grid Drawings of 3-Connected 1-Planar Graphse drawings. We show that every 3-connected 1-planar graph has a straight-line drawing on an integer grid of quadratic size, with the exception of a single edge on the outer face that has one bend. The drawing can be computed in linear time from any given 1-planar embedding of the graph.

Constitution

New Bounds on the Maximum Number of Edges in ,-Quasi-Planar Graphss in a .-quasi-planar graph on . vertices is .(.). Fox and Pach showed that every .-quasi-planar graph with . vertices and no pair of edges intersecting in more than .(1) points has at most .(log.). edges. We improve this upper bound to ., where .(.) denotes the inverse Ackermann function, and . dep

統(tǒng)治人類

Coordinate