Title: An Embedding Algorithm for Planar Graph Based on the Hopcroft-Tarjan Testing Algorithm
Abstract: This paper describes an embedding algorithm for planar graphs based on the Hopcroft-Tarjan Planarity Testing algorithm. Comparing to other embedding algorithms, the proposed algorithm is easy to be implemented , planarity testing and embedding are finished at the same time.
Publication Year: 2003
Publication Date: 2003-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot