Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
A minimum segment drawing Γ of a planar graph G is a straight line drawing of G that has the minimum number of segments among all straight line drawings of G. In this paper, we give a linear-time algorithm for computing a minimum segment drawing of a series-parallel graph with the maximum degree three. To the best of our knowledge, this is the first algorithm for computing minimum segment drawings of an important subclass of planar graphs.
- 7.Samee, M.A.H.: Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three. M.Sc. Engineering Thesis, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (July 2008)Google Scholar
- 8.Schnyder, W.: Embedding planar graphs on the grid. In: First ACM-SIAM Symp. on Discrete Algorithms, pp. 138–148 (1990)Google Scholar
- 10.Wagner, K.: Bemerkungen zum vierfarbenproblem. Jahresber. Deutsch. Math-Verein. 46, 26–32 (1936)Google Scholar