Ács, Bernadett and Szederkényi, Gábor and Tuza, Zoltán András and Tuza, Zsolt (2015) Computing Linearly Conjugate Weakly Reversible Kinetic Structures Using Optimization and Graph Theory. MATCHCOMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 74 (3). pp. 481504. ISSN 03406253

Text
match74n3_481_504_u.pdf Download (478kB)  Preview 
Abstract
A graphtheorybased algorithm is given in this paper for computing dense weakly reversible linearly conjugate realizations of kinetic systems using a fixed set of complexes. The algorithm is also able to decide whether such a realization exists or not. To prove the correctness of the method, it is shown that weakly reversible linearly conjugate chemical reaction network realizations containing the maximum number of directed edges form a unique superstructure among all linearly conjugate weakly reversible realizations. An illustrative example taken from the literature is used to show the operation of the algorithm.
Item Type:  Article 

Subjects:  Q Science / természettudomány > QA Mathematics / matematika > QA166QA166.245 Graphs theory / gráfelmélet 
SWORD Depositor:  MTMT SWORD 
Depositing User:  MTMT SWORD 
Date Deposited:  15 Sep 2016 14:28 
Last Modified:  15 Sep 2016 14:28 
URI:  http://real.mtak.hu/id/eprint/39564 
Actions (login required)
Edit Item 