Computing Linearly Conjugate Weakly Reversible Kinetic Structures Using Optimization and Graph Theory

Á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. MATCH Communications in Mathematical and in Computer Chemistry, 74 (3). pp. 489-512.

[img]
Preview
Text
Acs_489_2933020_ny.pdf

Download (509kB) | Preview

Abstract

A graph-theory-based 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 super-structure 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 > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Systems and Control Lab
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 11 Jan 2016 17:44
Last Modified: 11 Jan 2016 17:44
URI: http://eprints.sztaki.hu/id/eprint/8452

Update Item Update Item