Computing all possible graph structures describing linearly conjugate realizations of kinetic systems
Ács, Bernadett and Szederkényi, Gábor and Tuza, Zsolt and Tuza, Z A (2016) Computing all possible graph structures describing linearly conjugate realizations of kinetic systems. COMPUTER PHYSICS COMMUNICATIONS, 204. pp. 1120. ISSN 00104655 10.1016/j.cpc.2016.02.020

Text
Acs_11_3064467_ny.pdf Download (650kB)  Preview 

Text
Acs_11_3064467_z.pdf Restricted to Registered users only Download (565kB)  Request a copy 
Abstract
In this paper an algorithm is given to determine all possible structurally different linearly conjugate realizations of a given kinetic polynomial system. The solution is based on the iterative search for constrained dense realizations using linear programming. Since there might exist exponentially many different reaction graph structures, we cannot expect to have a polynomialtime algorithm, but we can organize the computation in such a way that polynomial time is elapsed between displaying any two consecutive realizations. The correctness of the algorithm is proved, and possibilities of a parallel implementation are discussed. The operation of the method is shown on two illustrative examples.
Item Type:  Article 

Uncontrolled Keywords:  SCHEMES; DEFICIENCY; Optimization; MASSACTION KINETICS; CHEMICALREACTION NETWORKS; Linear programming; Linear conjugacy; Reaction graphs; REACTION NETWORKS 
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:  17 Jan 2017 08:39 
Last Modified:  21 Jul 2019 14:09 
URI:  https://eprints.sztaki.hu/id/eprint/8938 
Update Item 