Computer program for finding all possible cycles in graphs
Copyright © 1984 John Wiley & Sons, Inc.
| Veröffentlicht in: | Journal of computational chemistry. - 1984. - 6(1985), 4 vom: 15. Aug., Seite 316-329 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
1985
|
| Zugriff auf das übergeordnete Werk: | Journal of computational chemistry |
| Schlagworte: | Journal Article |
| Zusammenfassung: | Copyright © 1984 John Wiley & Sons, Inc. A new approach is presented for identifying all possible cycles in graphs. Input data are the total numbers of vertices and edges, as well as the vertex adjacencies using arbitrary vertex numbering. A homeomorphically reduced graph (HRG) is constructed by ignoring vertices of degree less than three. The algorithm is based on successive generation of possible edge-combinations in the HRG. If a combination yields a cycle, it is either printed or stored and then finally printed in a list of all possible cycles arranged in the order of increasing ring size. A unique numbering of the cycle is used. The computer program is listed and exemplified. Computing times are given |
|---|---|
| Beschreibung: | Date Revised 20.11.2019 published: Print ErratumIn: J Comput Chem. 1986 Apr;7(2):253. - PMID 29165827 Citation Status PubMed-not-MEDLINE |
| ISSN: | 1096-987X |
| DOI: | 10.1002/jcc.540060409 |