Kirchhoff's Circuit Law Applications to Graph Simplification in Search Problems
- Authors
- Choi, J.; Kim, J.
- Issue Date
- 2020
- Publisher
- IEEE Computer Society
- Citation
- International Conference on ICT Convergence, v.2020-October, pp 81 - 86
- Pages
- 6
- Journal Title
- International Conference on ICT Convergence
- Volume
- 2020-October
- Start Page
- 81
- End Page
- 86
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/63562
- DOI
- 10.1109/ICTC49870.2020.9289222
- ISSN
- 2162-1233
- Abstract
- This paper proposes a new analysis of graph using the concept of electric potential, and also proposes a graph simplification method based on this analysis. Suppose that each node in the weighted-graph has its respective potential value. Furthermore, suppose that the start and terminal nodes in graphs have maximum and zero potentials, respectively. When we let the level of each node be defined as the minimum number of edges/hops from the start node to the node, the proper potential of each level can be estimated based on geometric proportionality relationship. Based on the estimated potential for each level, we can re-design the graph for path-finding problems to be the electrical circuits, thus Kirchhoff's Circuit Law can be directed applicable for simplifying the graph for path-finding problems. © 2020 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/63562)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.