Level Planarity: Transitivity vs. Even Crossings

08/29/2018
by   Guido Brückner, et al.
0

Recently, Fulek et al. have presented Hanani-Tutte results for (radial) level planarity, i.e., a graph is (radial) level planar if it admits a (radial) level drawing where any two (independent) edges cross an even number of times. We show that the 2-Sat formulation of level planarity testing due to Randerath et al. is equivalent to the strong Hanani-Tutte theorem for level planarity. Further, we show that this relationship carries over to radial level planarity, which yields a novel polynomial-time algorithm for testing radial level planarity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2019

Efficient Algorithms for Ortho-Radial Graph Drawing

Orthogonal drawings, i.e., embeddings of graphs into grids, are a classi...
research
06/01/2006

A parent-centered radial layout algorithm for interactive graph visualization and animation

We have developed (1) a graph visualization system that allows users to ...
research
07/31/2019

A Comparison of Radial and Linear Charts for Visualizing Daily Pattern

Radial charts are generally considered less effective than linear charts...
research
05/25/2018

Extended Formulations for Radial Cones

This paper studies extended formulations for radial cones at vertices of...
research
06/10/2021

A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing

Orthogonal drawings, i.e., embeddings of graphs into grids, are a classi...
research
08/24/2020

An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings

An ortho-radial grid is described by concentric circles and straight-lin...
research
05/21/2019

Learning Conserved Networks from Flows

The network reconstruction problem is one of the challenging problems in...

Please sign up or login with your details

Forgot password? Click here to reset