Cover Image

Pathway Realisability in Chemical Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Andersen, Jakob L., Banke, Sissel, Fagerberg, Rolf, Flamm, Christoph, Merkle, Daniel, Stadler, Peter F.
Format:	Preprint
Published:	2023
Subjects:	Molecular Networks Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Automated Inference of Graph Transformation Rules
by: Andersen, Jakob L., et al.
Published: (2024)

Saturation-Based Atom Provenance Tracing in Chemical Reaction Networks
by: Friedrichs, Marcel, et al.
Published: (2025)

Rule-Based Gillespie Simulation of Chemical Systems
by: Machado, Erika M. Herrera, et al.
Published: (2025)

Assembly in Directed Hypergraphs
by: Flamm, Christoph, et al.
Published: (2025)

Finding Thermodynamically Favorable Pathways in Chemical Reaction Networks Using Flows in Hypergraphs and Mixed-Integer Linear Programming
by: Pal, Adittya, et al.
Published: (2024)

On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs
by: Petersen, Johannes B. S., et al.
Published: (2025)

A Sensitivity Analysis Methodology for Rule-Based Stochastic Chemical Systems
by: Machado, Erika M. Herrera, et al.
Published: (2025)

Computation of Immediate Neighbours of Monotone Boolean Functions
by: Cury, José E. R., et al.
Published: (2024)

Refining Boolean models with the partial most permissive scheme
by: Boina, Nadine Ben, et al.
Published: (2024)

On the number of non-degenerate canalizing Boolean functions
by: Kadelka, Claus
Published: (2025)

Finding Pathways in Reaction Networks Guided by Energy Barriers Using Integer Linear Programing
by: Adittya Pal, et al.
Published: (2026)

Stability of Linear Boolean Networks
by: Chandrasekhar, Karthik, et al.
Published: (2022)

Strong regulatory graphs
by: Gustafsson, Patric, et al.
Published: (2023)

Canalization as a stabilizing principle of gene regulatory networks: a discrete dynamical systems perspective
by: Kadelka, Claus
Published: (2025)

A Bilevel Integer Programming Approach for the Synchronous Attractor Control Problem
by: Moon, Kyungduk, et al.
Published: (2026)

Reachability in Restricted Chemical Reaction Networks
by: Alaniz, Robert M., et al.
Published: (2022)

Chemically inspired Erdős-Rényi oriented hypergraphs
by: Garcia-Chung, Angel, et al.
Published: (2023)

A Multilayer Structure Facilitates the Production of Antifragile Systems in Boolean Network Models
by: Kim, Hyobin, et al.
Published: (2019)

A Novel Antifragility Measure Based on Satisfaction and Its Application to Random and Biological Boolean Networks
by: Pineda, Omar K., et al.
Published: (2018)

Scale Free Projections Arise from Bipartite Random Networks
by: Johnston, Josh, et al.
Published: (2024)

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
by: Jordon, Addie, et al.
Published: (2025)

Complexity of the Virtual Network Embedding with uniform demands
by: Benhamiche, Amal, et al.
Published: (2025)

Laplacian Network Optimization via Information Functions
by: Rosa, Samuel, et al.
Published: (2025)

Real-World Networks are Low-Dimensional: Theoretical and Practical Assessment
by: Friedrich, Tobias, et al.
Published: (2023)

A convenient trick to compute cluster sizes in a Network
by: Hsieh, Hsun-Yi, et al.
Published: (2024)

A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput
by: Bentert, Matthias, et al.
Published: (2026)

A Cheeger Inequality for Size-Specific Conductance
by: Huang, Yufan, et al.
Published: (2023)

Nesting of Touching Polygons
by: Seemann, Carsten R., et al.
Published: (2024)

Constructing and Sampling Directed Graphs with Linearly Rescaled Degree Matrices
by: Yan, Yunxiang, et al.
Published: (2025)

Clustering Coefficient Reflecting Pairwise Relationships within Hyperedges
by: Miyashita, Rikuya, et al.
Published: (2024)

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs
by: Deligkas, Argyrios, et al.
Published: (2024)

Expressivity of Geometric Inhomogeneous Random Graphs -- Metric and Non-Metric
by: Dayan, Benjamin, et al.
Published: (2024)

Alternative paths computation for congestion mitigation in segment-routing networks
by: Martin, Sébastien, et al.
Published: (2024)

Fast Reroute with Highly Connected Routes Based on Maximum Flow Evaluation
by: Okida, Leon, et al.
Published: (2024)

A decomposition approach for large virtual network embedding
by: Benhamiche, Amal, et al.
Published: (2025)

Forming Coordinated Teams that Balance Task Coverage and Expert Workload
by: Vombatkere, Karan, et al.
Published: (2025)

A Hierarchical Scale-free Graph Generator under Limited Resources
by: Qi, Xiaorui, et al.
Published: (2024)

On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation
by: Brunelli, Filippo, et al.
Published: (2021)

Ellipsoidal embeddings of graphs
by: Fanuel, Michaël, et al.
Published: (2024)

Age of Information Diffusion on Social Networks
by: Li, Songhua, et al.
Published: (2023)