Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks (Q2014813): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GLPK / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: YALMIP / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CLP / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CRNreals / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012543710 / rank | |||
Normal rank | |||
Latest revision as of 03:14, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks |
scientific article |
Statements
Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks (English)
0 references
16 June 2014
0 references
chemical reaction networks
0 references
weak reversibility
0 references
dynamical equivalence
0 references
linear conjugacy
0 references
optimization
0 references
