Abstract
A new fast and easy to implement algorithm for exhaustive ring perception is presented. This algorithm is based upon a progressive reduction (collapsing) of the path graph associated with the molecular graph studied. The path graph is an image of the molecular graph in which each vertex corresponds to a vertex of the molecular graph and each edge a-b describes an existing path between a and b in the molecular graph. During the reduction, nodes of the path graph are removed, and the information related to cycle occurrence is concentrated in the label of new edges between the remaining vertices. Each loop formed in the path graph during this collapsing process corresponds to a cycle in the molecular graph. Once the path graph has totally collapsed, all the rings in the molecular graph have been perceived.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Chemical Information and Computer Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
