crta
Hrvatska znanstvena Sekcija img
bibliografija
3 gif
 Naslovna
 O projektu
 FAQ
 Kontakt
4 gif
Pregledavanje radova
Jednostavno pretraživanje
Napredno pretraživanje
Skupni podaci
Upis novih radova
Upute
Ispravci prijavljenih radova
Ostale bibliografije
Slični projekti
 Bibliografske baze podataka

Pregled bibliografske jedinice broj: 363050

Časopis

Autori: Vukičević, Damir; Graovac, Ante
Naslov: An Algorithm to Enumerate a Special Class of Digraphs: Application to Water Clusters
( An Algorithm to Enumerate a Special Class of Digraphs: Application to Water Clusters )
Izvornik: Croatica Chemica Acta (0011-1643) 81 (2008), 2; 347-350
Vrsta rada: članak
Ključne riječi: digraphs; recursive algorithms; enumeration; optimization of algorithms; water clusters; hydrogen bonding
( digraphs; recursive algorithms; enumeration; optimization of algorithms; water clusters; hydrogen bonding )
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. The paper is dedicated to the memory of Professor Dean Rosenzweig.
Projekt / tema: 098-0982929-2940, 177-0000000-0884
Izvorni jezik: eng
Rad je indeksiran u
bazama podataka:
Current Contents Connect (CCC)
Scopus
SCI-EXP, SSCI i/ili A&HCI
Science Citation Index Expanded (SCI-EXP) (sastavni dio Web of Science Core Collectiona)
Kategorija: Znanstveni
Znanstvena područja:
Matematika,Fizika,Kemija
URL cjelovitog teksta:
Google Scholar: An Algorithm to Enumerate a Special Class of Digraphs: Application to Water Clusters
Upisao u CROSBI: graovac@irb.hr (graovac@irb.hr), 25. Srp. 2008. u 20:02 sati



  Verzija za printanje   za tiskati


upomoc
foot_4