Homotopy Height, Grid-Major Height and Graph-Drawing Height

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Article , Preprint , Conference object 01 Jan 2019Embargo end date: 01 Jan 2019 France English Publisher:Springer International PublishingFunded by:ANR | FOCAL, ANR | GATO, NSF | Collaborative Research: ...

Authors: Therese Biedl; Erin Wolf Chambers; David Eppstein; Arnaud de Mesmay; Tim Ophelders;

doi: 10.1007/978-3-030-35802-0_36 , 10.48550/arxiv.1908.05706

arXiv: 1908.05706

Homotopy Height, Grid-Major Height and Graph-Drawing Height

- Summary
- Subjects
- Metrics

Abstract

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.

28 pages, 11 figures. Expanded version of a paper in the Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019); for the proceedings version, see version 1

Country

France

Related Organizations

Michigan State University
United States
Saint Louis University
Spain
University of California System
United States
Department of Computer Science
Spain
Department of Computer Sciences
Austria

View all View all

Keywords

Computational Geometry (cs.CG), FOS: Computer and information sciences, [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average