%0 Journal Article %1 ISI:000377231300002 %A Acs, Bernadett %A Szederkenyi, Gabor %A Tuza, Zsolt %A Tuza, Zoltan A. %C PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS %D 2016 %I ELSEVIER SCIENCE BV %J COMPUTER PHYSICS COMMUNICATIONS %K Linear Reaction conjugacy; graphs; networks; programming} {Reaction %P 11-20 %R 10.1016/j.cpc.2016.02.020 %T Computing all possible graph structures describing linearly conjugate realizations of kinetic systems %V 204 %X 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. (C) 2016 Elsevier B.V. All rights reserved.

@article{ISI:000377231300002, 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. (C) 2016 Elsevier B.V. All rights reserved.}}, added-at = {2017-05-18T11:32:12.000+0200}, address = {{PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS}}, affiliation = {{Szederkenyi, G (Reprint Author), Hungarian Acad Sci, Inst Comp Sci \& Control MTA SZTAKI, Syst \& Control Lab, Kende U 13-17, H-1111 Budapest, Hungary. Acs, Bernadett; Szederkenyi, Gabor, Pazmany Peter Catholic Univ, Fac Informat Technol \& Bion, Prater U 50-A, H-1083 Budapest, Hungary. Szederkenyi, Gabor, Hungarian Acad Sci, Inst Comp Sci \& Control MTA SZTAKI, Syst \& Control Lab, Kende U 13-17, H-1111 Budapest, Hungary. Tuza, Zsolt, Univ Pannonia, Dept Comp Sci \& Syst Technol, Egyetem U 10, H-8200 Veszprem, Hungary. Tuza, Zsolt, Hungarian Acad Sci, Alfred Renyi Inst Math, Realtanoda U 13-15, H-1053 Budapest, Hungary. Tuza, Zoltan A., Univ Stuttgart, Inst Syst Theory \& Automat Control, Pfaffenwaldring 9, D-70569 Stuttgart, Germany.}}, author = {Acs, Bernadett and Szederkenyi, Gabor and Tuza, Zsolt and Tuza, Zoltan A.}, author-email = {{acs.bernadett@itk.ppke.hu szederkenyi@itk.ppke.hu tuza@dcs.uni-pannon.hu zoltan.tuza@ist.uni-stuttgart.de}}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2f683d9b86f63206dfd66dea2c2e4e9c8/hermann}, doi = {{10.1016/j.cpc.2016.02.020}}, eissn = {{1879-2944}}, funding-acknowledgement = {{Hungarian National Research, Development and Innovation Office-NKFIH {[}OTKA NF104706, 115694]; {[}KAP15-052-1.1-ITK]}}, funding-text = {{This project was developed within the PhD program of the Roska Tamas Doctoral School of Sciences and Technology, Faculty of Information Technology and Bionics, Pazmany Peter Catholic University, Budapest. The authors gratefully acknowledge the support of the Hungarian National Research, Development and Innovation Office-NKFIH through grants OTKA NF104706 and 115694. The support of Pazmany Peter Catholic University is also acknowledged through the project KAP15-052-1.1-ITK. The authors thank Dr. Istvan Reguly for his help in evaluating the computation results of the parallel implementation of the algorithm. The authors are grateful to the anonymous reviewers for their constructive comments. The last author's research was performed while ZT was with the Faculty of Information Technology and Bionics of Pazmany Peter Catholic University.}}, interhash = {50963634fe42e56985ae7f09d7f88818}, intrahash = {f683d9b86f63206dfd66dea2c2e4e9c8}, issn = {{0010-4655}}, journal = {{COMPUTER PHYSICS COMMUNICATIONS}}, keywords = {Linear Reaction conjugacy; graphs; networks; programming} {Reaction}, keywords-plus = {{CHEMICAL-REACTION NETWORKS; MASS-ACTION KINETICS; OPTIMIZATION; DEFICIENCY; SCHEMES}}, language = {{English}}, month = {{JUL}}, number-of-cited-references = {{38}}, pages = {{11-20}}, publisher = {{ELSEVIER SCIENCE BV}}, research-areas = {{Computer Science; Physics}}, times-cited = {{0}}, timestamp = {2017-05-18T09:32:12.000+0200}, title = {{Computing all possible graph structures describing linearly conjugate realizations of kinetic systems}}, type = {{Article}}, volume = {{204}}, web-of-science-categories = {{Computer Science, Interdisciplinary Applications; Physics, Mathematical}}, year = {{2016}} }