Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
For a simple graph G let NG(u) be the (open) neighborhood of vertex u V (G). Then G is neighborhood anti-Sperner (NAS) if for every u there is a v V (G)\{u} with NG(u) NG(v). A...
Influential people have an important role in the process of information diffusion. However, there are several ways to be influential, for example, to be the most popular or the...