On finding hypercycles in chemical reaction networks
Applied Mathematics Letters, cilt.21, sa.9, ss.881-884, 2008 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 21 Sayı: 9
- Basım Tarihi: 2008
- Doi Numarası: 10.1016/j.aml.2007.07.031
- Dergi Adı: Applied Mathematics Letters
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.881-884
- Anahtar Kelimeler: Chemical reaction networks, Directed hypergraphs, Hypercycles
- Boğaziçi Üniversitesi Adresli: Evet
Özet
Directed hypercycles have recently been used to model chemical reaction networks. We present an NP-completeness proof for the problem of finding a hypercycle in a directed hypergraph. This sheds some light to some open questions posed by Zeigarnik [A.V. Zeigarnik, On hypercycles and hypercircuits in hypergraphs, in: Discrete Mathematical Chemistry, in: DIMACS Series in, Discrete Mathematics and Theoretical Computer Science, vol. 51, AMS, 2000, pp. 377-383] who modelled chemical reactions by directed hypergraphs. © 2007 Elsevier Ltd. All rights reserved.