Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
: Directories provide a general mechanism for describing resources and enabling information sharing within and across organizations. Directories must resolve differing structures a...
A top-k query combines different rankings of the same set of objects and returns the k objects with the highest combined score according to an aggregate function. We bring to ligh...
Nikos Mamoulis, Kit Hung Cheng, Man Lung Yiu, Davi...
Compared to conventional wireless sensor networks (WSNs) that are operated based on the client-server computing model, mobile agent (MA) systems provide new capabilities for energy...
Min Chen, Victor C. M. Leung, Shiwen Mao, Taekyoun...
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...