A New Approach for Vertex Guarding of Planar Graphs
|
| Title | A New Approach for Vertex Guarding of Planar Graphs |
| Authors | |
| Abstract | Vertex guarding is one of many optimisation problems in graph theory with wide area of applications. It is proven to be NP-hard, therefore fast approximative solutions are significant. In the paper, at first, known algorithms are considered, and then a new algorithm working on planar graphs is introduced. The new algorithm is based on the dynamic approach and produces better and faster solutions. Its efficiency among other algorithms is demonstrated experimentally. In addition, ideas to additionally improve the algorithm are presented at the end. |
| Publisher | University of Zagreb, University Computing Centre - SRCE |
| Date | 1970-01-01 |
| Source | Journal of Computing and Information Technology Vol 10, No 3 (2002): Special Issue on ITI 2002 - Information Technology Interfaces |
| Rights | CIT. Journal of Computing and Information Technology is an open access journal.Authors who publish with this journal agree to the following terms:Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work´s authorship and initial publication in this journal.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal´s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access). |