An algorithm is given in this paper for the computation of dynamically
equivalent weakly reversible realizations with the maximal number of reactions,
for chemical reaction networks (CRNs) with mass action kinetics. The original
problem statement can be traced back at least 30 years ago. The algorithm uses
standard linear and mixed integer linear programming, and it is based on
elementary graph theory and important former results on the dense realizations
of CRNs. The proposed method is also capable of determining if no dynamically
equivalent weakly reversible structure exists for a given reaction network with
a previously fixed complex set.Comment: 18 pages, 9 figure