The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hyper...
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Abstract. JeromeDL is a Semantic Digital Library engine. It uses Semantic Web and Social Networking technologies to improve browsing and searching for resources. With JeromeDL’s ...
Sebastian Ryszard Kruk, Tomasz Woroniecki, Adam Gz...
Research involving different forms of networks, such as internet networks, social networks, and cellular networks, has increasingly become an important field of study. From this wo...