A new approach for finding a maximum planar subset of a set of nets for electronic devices’ physical design automation has been considered. The approach, unlike other methods, uses three types of relations between nets: following one net after another without crossing, following with crossing, and inclusion of one net into the other. This allows us to build graphs of such relations, which are used to find maximum number of uncrossing nets and to minimize number of layers. The method allows to choose different variants of the solutions, which creates the conditions for taking into account other design requirements besides planarization. The computational complexity of the algorithm for real electronic devices’ is within Ω(n) and O(n²).