Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Background: Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complex...
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
Structure analysis of table form document is important because printed documents and also electronical documents only provide geometrical layout and lexical information explicitly...
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...