Abstract
In this paper presented are a graph-planarization algorithm and the results obtained by the application of the algorithm to random graphs. The algorithm tests the subgraph of the given graph G for planarity and if the subgraph fails the test, it deletes a minimum number of edges necessary for planarization. The subgraph has one vertex at the beginning, and the number of its vertices is increased one by one until all the vertices of G are included in it. The result from the application of the algorithm to random graphs indicates that the time complexity of the algorithm is O(np) with p=1.4≈1.5 in average, where n is the number of verticles of G.
Cite
CITATION STYLE
Ozawa, T., & Takahashi, H. (1981). A graph-planarization algorithm and its application to random graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 108 LNCS, pp. 95–107). Springer Verlag. https://doi.org/10.1007/3-540-10704-5_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
