Candido F. X. de Mendonça

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A non-planar graph can only be planarised if it is structurally modified. This work presents a new heuristic algorithm that uses vertices deletion to modify a non-planar graph in order to obtain a planar subgraph. The proposed algorithm aims to delete a minimum number of vertices to achieve its goal. The vertex deletion number of a graph G = (V,E) is the(More)
  • 1