Á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. 11-20. ISSN 0010-4655 10.1016/j.cpc.2016.02.020

Preview	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 polynomial-time 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.

Update Item