Kirchhoff's Circuit Law Applications to Graph Simplification in Search Problems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, J. | - |
dc.contributor.author | Kim, J. | - |
dc.date.accessioned | 2023-03-08T14:48:03Z | - |
dc.date.available | 2023-03-08T14:48:03Z | - |
dc.date.issued | 2020 | - |
dc.identifier.issn | 2162-1233 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/63562 | - |
dc.description.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. | - |
dc.format.extent | 6 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE Computer Society | - |
dc.title | Kirchhoff's Circuit Law Applications to Graph Simplification in Search Problems | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/ICTC49870.2020.9289222 | - |
dc.identifier.bibliographicCitation | International Conference on ICT Convergence, v.2020-October, pp 81 - 86 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.scopusid | 2-s2.0-85098987187 | - |
dc.citation.endPage | 86 | - |
dc.citation.startPage | 81 | - |
dc.citation.title | International Conference on ICT Convergence | - |
dc.citation.volume | 2020-October | - |
dc.type.docType | Conference Paper | - |
dc.subject.keywordPlus | Electric potential | - |
dc.subject.keywordPlus | Timing circuits | - |
dc.subject.keywordPlus | Electrical circuit | - |
dc.subject.keywordPlus | Graph simplification | - |
dc.subject.keywordPlus | Kirchhoff | - |
dc.subject.keywordPlus | Path finding problems | - |
dc.subject.keywordPlus | Potential values | - |
dc.subject.keywordPlus | Search problem | - |
dc.subject.keywordPlus | Terminal nodes | - |
dc.subject.keywordPlus | Weighted graph | - |
dc.subject.keywordPlus | Graph theory | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.