An evolutionary algorithm for graph planarisation by vertex deletion
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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Scitepress
2014
|
| Online Access: | http://eprints.nottingham.ac.uk/31330/ http://eprints.nottingham.ac.uk/31330/ http://eprints.nottingham.ac.uk/31330/1/dls_iceis2014.pdf |