An efficient enumeration algorithm is developed from sufficient conditions on subgraphs in the bipartite König representation to identify autocatalytic subnetworks and minimal cores in full metabolic networks.
Russian Mathematical Surveys 29(6):89– 156, DOI 10.1070/RM1974v029n06ABEH001303
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Provides a complete characterization of epimorphisms for universal hypergraphic automata via conditions on maps of state and output hypergraphs, after defining weak and strong epimorphisms that agree on p*-hypergraphs.
citing papers explorer
-
On Epimorphisms of Hypergraphic Automata and Input Symbol Semigroups
Provides a complete characterization of epimorphisms for universal hypergraphic automata via conditions on maps of state and output hypergraphs, after defining weak and strong epimorphisms that agree on p*-hypergraphs.