Counting substrate cycles in topologically restricted metabolic networks

DOI10.1007/978-3-319-58741-7_14zbMath1491.92049OpenAlexW2612871164MaRDI QIDQ2011645

Robert D. Barish, Akira Suyama

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_14

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Systems biology, networks (92C42)

Related Items (1)

Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs

Uses Software

• KEGG

Cites Work

• Approximately counting paths and cycles in a graph
• The complexity of computing the permanent
• Monte-Carlo algorithms for the planar multiterminal network reliability problem
• On generating all maximal independent sets
• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
• The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
• The relative complexity of approximate counting problems
• The Complexity of Enumeration and Reliability Problems
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Computational Complexity
• On Unapproximable Versions of $NP$-Complete Problems
• Unnamed Item

This page was built for publication: Counting substrate cycles in topologically restricted metabolic networks