An application of well-orderly trees in graph drawing

Authors:
Huaming Zhang;Xin He
Affiliations:
Department of Computer Science, University of Alabama in Huntsville, Huntsville, AL;Department of Computer Science and Engineering, SUNY at Buffalo, Buffalo, NY
Venue:
GD'05 Proceedings of the 13th international conference on Graph Drawing
Year:
2005

Citing 13
Cited 4

Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems

Theoretical Computer Science
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Orderly spanning trees with applications to graph encoding and graph drawing

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Wagner's Theorem on Realizers

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
2-Visibility Drawings of Planar Graphs

GD '96 Proceedings of the Symposium on Graph Drawing
Floor-Planning via Orderly Spanning Trees

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Some Applications of Orderly Spanning Trees in Graph Drawing

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer

SIAM Journal on Discrete Mathematics
Improved visibility representation of plane graphs

Computational Geometry: Theory and Applications
Drawing planar graphs using the lmc-ordering

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
New theoretical bounds of visibility representation of plane graphs

GD'04 Proceedings of the 12th international conference on Graph Drawing

Visibility representations of four-connected plane graphs with near optimal heights

Computational Geometry: Theory and Applications
Compact visibility representation of 4-connected plane graphs

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Nearly optimal visibility representations of plane graphs

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Compact visibility representation of 4-connected plane graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Well-orderly trees seem to have the potential of becoming a powerful technique capable of deriving new results in graph encoding, graph enumeration and graph generation [3, 4]. In this paper, we reduce the height of the visibility representation of plane graphs from 5n/6 to (4n–1)/5, by using well-orderly trees.