Computer program for finding all possible cycles in graphs

Copyright © 1984 John Wiley & Sons, Inc.

Bibliographische Detailangaben
Veröffentlicht in:Journal of computational chemistry. - 1984. - 6(1985), 4 vom: 15. Aug., Seite 316-329
1. Verfasser: Balaban, Alexandru T (VerfasserIn)
Weitere Verfasser: Filip, Petru, Balaban, Teodor-Silviu
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 1985
Zugriff auf das übergeordnete Werk:Journal of computational chemistry
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM278307299
003 DE-627
005 20231225020247.0
007 cr uuu---uuuuu
008 231225s1985 xx |||||o 00| ||eng c
024 7 |a 10.1002/jcc.540060409  |2 doi 
028 5 2 |a pubmed24n0927.xml 
035 |a (DE-627)NLM278307299 
035 |a (NLM)29164640 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Balaban, Alexandru T  |e verfasserin  |4 aut 
245 1 0 |a Computer program for finding all possible cycles in graphs 
264 1 |c 1985 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Revised 20.11.2019 
500 |a published: Print 
500 |a ErratumIn: J Comput Chem. 1986 Apr;7(2):253. - PMID 29165827 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a Copyright © 1984 John Wiley & Sons, Inc. 
520 |a 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 
650 4 |a Journal Article 
700 1 |a Filip, Petru  |e verfasserin  |4 aut 
700 1 |a Balaban, Teodor-Silviu  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t Journal of computational chemistry  |d 1984  |g 6(1985), 4 vom: 15. Aug., Seite 316-329  |w (DE-627)NLM098138448  |x 1096-987X  |7 nnns 
773 1 8 |g volume:6  |g year:1985  |g number:4  |g day:15  |g month:08  |g pages:316-329 
856 4 0 |u http://dx.doi.org/10.1002/jcc.540060409  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 6  |j 1985  |e 4  |b 15  |c 08  |h 316-329