Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
This paper presents a technique that limits the maximum number of specified bits of any pattern in a given test set. The outlined method uses algorithms similar to ATPG, but explo...
Michael A. Kochte, Christian G. Zoellin, Michael E...
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
Motivation: Protein–protein complexes are known to play key roles in many cellular processes. However, they are often not accessible to experimental study because of their low s...
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...