Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
In this paper, we propose an approach to automatically mine event evolution graphs from newswires on the Web. Event evolution graph is a directed graph in which the vertices and e...
RDF (“Resource Description Framework”) is now a widely used World Wide Web Consortium standard. However, methods to index large volumes of RDF data are still in their infancy....
Octavian Udrea, Andrea Pugliese, V. S. Subrahmania...
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...