2000 character limit reached
Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
Published 12 Jun 2020 in cs.DS, cs.CG, and cs.DM | (2006.06951v4)
Abstract: We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding that the drawing has to respect and if it does not. Our algorithm returns a planar rectilinear drawing if the graph admits one.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.