A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
A 1-planar graph is a graph that can be embedded in the plane with at most one crossing per edge. It is known that testing 1-planarity of a graph is NP-complete. In this paper, we consider maximal 1-planar graphs. A graph G is maximal 1-planar if addition
|Collections||ANU Research Publications|
|Source:||Theoretical Computer Science|
|01_Eades_A_linear_time_algorithm_for_2013.pdf||254.24 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.