Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario

Bitonic st -orderings for st -planar graphs were introduced as a method to cope with several graph drawing problems. Notably, they have been used to obtain the best-known upper bound on the number of bends for upward planar polyline drawings with at most one bend per edge in polynomial area. For an...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 85; no. 9; pp. 2667 - 2692
Main Authors:	Angelini, Patrizio, Bekos, Michael A., Förster, Henry, Gronemann, Martin
Format:	Journal Article
Language:	English
Published:	New York Springer US 01-09-2023 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Bends Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Embedding Graph theory Graphs Lower bounds Mathematics of Computing Optimization Polynomials Theory of Computation Upper bounds Bend minimization Bitonic st-orderings Planar polyline drawings Upward planar graphs
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!