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.
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.
Repository Staff Only: item control page