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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Samee, M. A. H., Alam, M. J., Adnan, M. A., & Rahman, M. S. (2009). Minimum segment drawings of series-parallel graphs with the maximum degree three. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 408–419). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_40
Mendeley helps you to discover research relevant for your work.