In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Abstract. Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly i...
As the sizes of general and special purpose processors increase rapidly, generating high quality manufacturing tests which can be run at native speeds is becoming a serious proble...
Raghuram S. Tupuri, Arun Krishnamachary, Jacob A. ...
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...