Abstract

Summary. The spatial relational PLA-Model is very handy to store two-connected planar graphs, but in its original form it is not capable at all to store any other important classes of planar graphs. In this paper we enhance the model and describe a method to represent trees. The approach is based on Halin graphs, that are planar graphs of minimum degree 3 from which a tree is obtained when the boundary edges of the infinite region are removed. We show how Halin graphs can be identified from the model, and how trees can be represented as virtual Halin graphs in order to store them without major alteration of the original PLA-Model.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.