Defines MR-networks and MRL logic to model regulated biochemical reactions, establish validities, express properties like reachability and attractors, and provide model-checking and bisimulation results.
Time constrained graph searching
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
An O(4^{k + k log k} n + n m^2)-time algorithm for TREE CONTAINMENT parameterized by scanwidth k of a given tree-extension, with a matching ETH lower bound of no 2^{o(c log c)} n^{O(1)} algorithm for directed cutwidth c even on binary inputs.
Deciding ffn(G) <= m is NP-hard, shortest strategies on complete binary trees have superpolynomial length, with almost sharp bounds for those trees and transfer of results to the Hunter and Rabbit game.
citing papers explorer
-
Modulation-Reaction Networks
Defines MR-networks and MRL logic to model regulated biochemical reactions, establish validities, express properties like reachability and attractors, and provide model-checking and bisimulation results.