hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.2002.03.06

A New Approach for Vertex Guarding of Planar Graphs

Borut Žalik
Branko Kaučič

Puni tekst: engleski, pdf (200 KB) str. 189-194 preuzimanja: 270* citiraj
APA 6th Edition
Žalik, B. i Kaučič, B. (2002). A New Approach for Vertex Guarding of Planar Graphs. Journal of computing and information technology, 10 (3), 189-194. https://doi.org/10.2498/cit.2002.03.06
MLA 8th Edition
Žalik, Borut i Branko Kaučič. "A New Approach for Vertex Guarding of Planar Graphs." Journal of computing and information technology, vol. 10, br. 3, 2002, str. 189-194. https://doi.org/10.2498/cit.2002.03.06. Citirano 20.07.2019.
Chicago 17th Edition
Žalik, Borut i Branko Kaučič. "A New Approach for Vertex Guarding of Planar Graphs." Journal of computing and information technology 10, br. 3 (2002): 189-194. https://doi.org/10.2498/cit.2002.03.06
Harvard
Žalik, B., i Kaučič, B. (2002). 'A New Approach for Vertex Guarding of Planar Graphs', Journal of computing and information technology, 10(3), str. 189-194. https://doi.org/10.2498/cit.2002.03.06
Vancouver
Žalik B, Kaučič B. A New Approach for Vertex Guarding of Planar Graphs. Journal of computing and information technology [Internet]. 2002 [pristupljeno 20.07.2019.];10(3):189-194. https://doi.org/10.2498/cit.2002.03.06
IEEE
B. Žalik i B. Kaučič, "A New Approach for Vertex Guarding of Planar Graphs", Journal of computing and information technology, vol.10, br. 3, str. 189-194, 2002. [Online]. https://doi.org/10.2498/cit.2002.03.06

Sažetak
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.

Hrčak ID: 44778

URI
https://hrcak.srce.hr/44778

Posjeta: 362 *