On finding hypercycles in chemical reaction networks

  title={On finding hypercycles in chemical reaction networks},
  author={Can C. {\"O}zturan},
  journal={Appl. Math. Lett.},
Directed hypercycles have recently been used to model chemical reaction networks. We present an NP-completeness proof for the problem of finding a hypercycle in a directed hypergraph. This sheds some light to some open questions posed by Zeigarnik [A.V. Zeigarnik, On hypercycles and hypercircuits in hypergraphs, in: Discrete Mathematical Chemistry, in: DIMACS Series in, Discrete Mathematics and Theoretical Computer Science, vol. 51, AMS, 2000, pp. 377–383] who modelled chemical reactions by… CONTINUE READING

From This Paper

Topics from this paper.
4 Citations
14 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 14 references


  • P. M. Gleiss, P. F. Stadler, A. Wagner
  • Relevant cycles in chemical reaction networks…
  • 2001
2 Excerpts

Zeigarnik , On hypercycles and hypercircuits in hypergraphs

  • V. A.
  • DIMACS Series in Discrete Mathematics and…
  • 2000

Chemical Reaction Networks: A Graph Theoretical Approach

  • O. Temkin, A. Zeigarnik, D. Bonchev
  • CRC Press
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…