APPLICATIONS OF CHINESE POSTMAN PROBLEM, DOMINATING SET, AND SPECTRAL GRAPH PARTITION IN GRAPH THEORY FOR SECURITY SURVEILLANCE PROBLEM
Safety issues are quite crucial currently. Cases of motor vehicle and treasure thefts are quite common due to victim or security carelessness. In the residential complex, security officer usually patrols at any time to monitor the people movements around them that could potentially interfere regiona...
Saved in:
Main Author: | Permadani, Bayu |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/49877 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
On the Ant Colony System for Postman Problem
by: Hoang Xuan Huan, Dinh Trung Hoang
Published: (2017) -
SPECTRAL GAP PROBLEM OF CERTAIN GRAPHS
by: Samuel, Opiyo -
A problem on clique partitions of regular graphs
by: Campena, Francis Joseph H., et al.
Published: (2018) -
Learning algorithm for the uniform graph partitioning problem
by: Chua, C.B., et al.
Published: (2014) -
A Weighted Graph Partitioning Problem with Side Constraints
by: HUM, Sin Hoon, et al.
Published: (1992)