hrcak mascot   Srce   HID

Izlaganje sa skupa

An Algorithm to Enumerate a Special Class of Digraphs: Application to Water Clusters

Damir Vukičević ; Faculty of Science, University of Split, Split, Croatia
Ante Graovac ; Faculty of Science, University of Split, Split, Croatia; Ruđer Bošković Institute, Zagreb, Croatia

Puni tekst: engleski, pdf (64 KB) str. 347-350 preuzimanja: 407* citiraj
APA 6th Edition
Vukičević, D. i Graovac, A. (2008). An Algorithm to Enumerate a Special Class of Digraphs: Application to Water Clusters. Croatica Chemica Acta, 81 (2), 347-350. Preuzeto s https://hrcak.srce.hr/28503
MLA 8th Edition
Vukičević, Damir i Ante Graovac. "An Algorithm to Enumerate a Special Class of Digraphs: Application to Water Clusters." Croatica Chemica Acta, vol. 81, br. 2, 2008, str. 347-350. https://hrcak.srce.hr/28503. Citirano 18.11.2019.
Chicago 17th Edition
Vukičević, Damir i Ante Graovac. "An Algorithm to Enumerate a Special Class of Digraphs: Application to Water Clusters." Croatica Chemica Acta 81, br. 2 (2008): 347-350. https://hrcak.srce.hr/28503
Harvard
Vukičević, D., i Graovac, A. (2008). 'An Algorithm to Enumerate a Special Class of Digraphs: Application to Water Clusters', Croatica Chemica Acta, 81(2), str. 347-350. Preuzeto s: https://hrcak.srce.hr/28503 (Datum pristupa: 18.11.2019.)
Vancouver
Vukičević D, Graovac A. An Algorithm to Enumerate a Special Class of Digraphs: Application to Water Clusters. Croatica Chemica Acta [Internet]. 2008 [pristupljeno 18.11.2019.];81(2):347-350. Dostupno na: https://hrcak.srce.hr/28503
IEEE
D. Vukičević i A. Graovac, "An Algorithm to Enumerate a Special Class of Digraphs: Application to Water Clusters", Croatica Chemica Acta, vol.81, br. 2, str. 347-350, 2008. [Online]. Dostupno na: https://hrcak.srce.hr/28503. [Citirano: 18.11.2019.]

Sažetak
Recently Miyake and Aida have developed a directed graph model and related algorithm which
generates all possible topologically distinct hydrogen-bonded clusters of water molecules.
Here we present a new algorithm based on recursive functions. Numerical results show that our
algorithm is much faster than that of Miyake and Aida.

Ključne riječi
digraphs; recursive algorithms; enumeration; optimization of algorithms; water clusters; hydrogen bonding

Hrčak ID: 28503

URI
https://hrcak.srce.hr/28503

Posjeta: 624 *