Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
Danny van Noort, Frank-Ulrich Gast, John S. McCask...
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
Jochen Harant, Michael A. Henning, Dieter Rautenba...
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...