Homotopy height, grid-major height and graph-drawing height

08/15/2019
by   Therese Biedl, et al.
0

It is well-known that both the pathwidth and the outer-planarity of a graph can be used to obtain lower bounds on the height of a planar straight-line drawing of a graph. But both bounds fall short for some graphs. In this paper, we consider two other parameters, the (simple) homotopy height and the (simple) grid-major height. We discuss the relationship between them and to the other parameters, and argue that they give lower bounds on the straight-line drawing height that are never worse than the ones obtained from pathwidth and outer-planarity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2020

Drawing Halin-graphs with small height

In this paper, we study how to draw Halin-graphs, i.e., planar graphs th...
research
08/31/2017

On Upward Drawings of Trees on a Given Grid

Computing a minimum-area planar straight-line drawing of a graph is know...
research
03/16/2022

Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals

We consider drawings of graphs in the plane in which vertices are assign...
research
06/30/2019

Dimension is polynomial in height for posets with planar cover graphs

We show that height h posets that have planar cover graphs have dimensio...
research
03/09/2020

Smoothed Analysis of Trie Height by Star-like PFAs

Tries are general purpose data structures for information retrieval. The...
research
02/21/2022

Defining long words succinctly in FO and MSO

We consider the length of the longest word definable in FO and MSO via a...
research
02/15/2019

Certified Reduced Basis VMS-Smagorinsky model for natural convection flow in a cavity with variable height

In this work we present a Reduced Basis VMS-Smagorinsky Boussinesq model...

Please sign up or login with your details

Forgot password? Click here to reset