In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset co...
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
U. Kang, Charalampos E. Tsourakakis, Ana Paula App...
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...