Abstract
We consider different plane embeddings of partial 2-trees and give an efficient algorithm constructing a minimum cardinality cover of faces, where each face is covered by exactly one vertex. These tasks are facilitated by a unique tree representation of plane embeddings of 2-trees.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
