A robust method for searching the smallest set of smallest rings with a path-included distance matrix
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Chang Joon | - |
dc.contributor.author | Kang, Young-Mook | - |
dc.contributor.author | Cho, Kwang-Hwi | - |
dc.contributor.author | No, Kyoung Tai | - |
dc.date.available | 2018-05-10T15:16:23Z | - |
dc.date.created | 2018-04-17 | - |
dc.date.issued | 2009-10-13 | - |
dc.identifier.issn | 0027-8424 | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/15756 | - |
dc.description.abstract | The perception of rings in graphs is widely used in many fields of science and engineering. Algorithms developed in the chemistry community, called smallest set of smallest rings (SSSR), applicable only for simple graphs or chemical structures. In contrast, algorithms developed by the computer science community, called minimum cycle basis (MCB) are identical to SSSR yet exhibit greater robustness. MCB-based algorithms can correctly reveal all rings in any complex graph. However, they are slow when applied to large complex graphs due to the inherent limitations of the algorithms used. Here, we suggest a heuristic method called RP-Path. This method is a robust, simple, and fast search method with O(n(3)) runtime algorithm that correctly identifies the SSSR of all of the test case of complex graphs by using approach different from the MCB-based method. Both the robustness and improvement in speed are achieved by using a path-included distance matrix and describing the characteristic features of rings in the matrix. This method is accurate and faster than any other methods and may find many application in various fields of science and engineering that use complicated graphs with thousands of nodes. | - |
dc.publisher | NATL ACAD SCIENCES | - |
dc.relation.isPartOf | PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA | - |
dc.subject | POLYNOMIAL-TIME ALGORITHM | - |
dc.subject | UNDIRECTED LINEAR GRAPHS | - |
dc.subject | MINIMUM CYCLE BASIS | - |
dc.subject | ORGANIC STRUCTURES | - |
dc.subject | PERCEPTION | - |
dc.subject | SELECTION | - |
dc.subject | FIND | - |
dc.title | A robust method for searching the smallest set of smallest rings with a path-included distance matrix | - |
dc.type | Article | - |
dc.identifier.doi | 10.1073/pnas.0813040106 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, v.106, no.41, pp.17355 - 17358 | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000270754400026 | - |
dc.identifier.scopusid | 2-s2.0-70350438602 | - |
dc.citation.endPage | 17358 | - |
dc.citation.number | 41 | - |
dc.citation.startPage | 17355 | - |
dc.citation.title | PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA | - |
dc.citation.volume | 106 | - |
dc.contributor.affiliatedAuthor | Cho, Kwang-Hwi | - |
dc.type.docType | Article | - |
dc.description.oadoiVersion | published | - |
dc.subject.keywordAuthor | graph theory | - |
dc.subject.keywordAuthor | MCB | - |
dc.subject.keywordAuthor | ring perception | - |
dc.subject.keywordAuthor | RP-Path | - |
dc.subject.keywordAuthor | SSSR | - |
dc.subject.keywordPlus | POLYNOMIAL-TIME ALGORITHM | - |
dc.subject.keywordPlus | UNDIRECTED LINEAR GRAPHS | - |
dc.subject.keywordPlus | MINIMUM CYCLE BASIS | - |
dc.subject.keywordPlus | ORGANIC STRUCTURES | - |
dc.subject.keywordPlus | PERCEPTION | - |
dc.subject.keywordPlus | SELECTION | - |
dc.subject.keywordPlus | FIND | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL 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.