Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations

Chen, Ho-Lin and Yen, Hsu-Chun (1999) Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 416-417 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_43).

Full text not available from this repository.

Abstract

The concept of a hierarchical design has played an important role in various areas of computer science and engineering, including software engineering, CAD, among others. Graphs with hierarchical structures, which are capable of describing large-scale regular structures in a succinct manner, have naturally become an interesting and important modeling tool for facilitating such a hierarchical design. In the literature, a number of succinct models for representing graphs with hierarchical structures have been proposed. See, e.g., [4,5]. In each of such hierarchical graph models, a succinct description is capable of representing a graph (which can be thought of as the expansion of the description) whose size is exponential in the length of the description.

Item Type:Conference Paper
Additional Information:10.1007/3-540-46648-7_43
Classifications:M Methods > M.500 Layered
P Styles > P.720 Straight-line
P Styles > P.480 Layered
P Styles > P.600 Poly-line > P.600.700 Orthogonal
P Styles > P.999 Others
ID Code:381

Repository Staff Only: item control page

References

F. Brandenburg, Designing Graph Drawings by Layout Graph Grammars, Graph Drawing '94, LNCS 894, pp. 416-427, 1994.

G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.

P. Eades, X. Lin, and R. Tamassia, An Algorithm for Drawing a Hierarchical Graph, Internat. J. Comput. Geom. Appl., Vol. 6, pp. 145-156, 1996.

T. Lengauer, Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs, J. Algorithms, Vol. 8. pp. 260-284, 1987.

T. Lengauer, Hierarchical Planarity Testing Algorithms, J. ACM, Vol. 36, No.3, pp. 475-509, 1989.