MatlabBGL is a Matlab package for working with graphs. It uses the Boost Graph Library to efficiently implement the graph algorithms. MatlabBGL is designed to work with large sparse graphs with hundreds of thousands of nodes.
To mark the 40th anniversary of the Internet, DARPA has announced the DARPA Network Challenge, a competition that will explore the roles the Internet and social networking play in the timely communication, wide-area team-building, and urgent mobilization required to solve broad-scope, time-critical problems.
The challenge is to be the first to submit the locations of 10 moored, 8-foot, red, weather balloons at 10 fixed locations in the continental United States. The balloons will be in readily accessible locations and visible from nearby roads.
MatlabBGL is a Matlab package for working with graphs. It uses the Boost Graph Library to efficiently implement the graph algorithms. MatlabBGL is designed to work with large sparse graphs with hundreds of thousands of nodes.
An expandable framework, operating within MatLab, which provides a convenient environment for import/export, manipulation and analysis of complex networks. Currently, the toolbox contains dozens of efficiently implemented and thoroughly validated algorithms. Most of these algorithms are implemented as C++ mex-files to achieve maximal efficiency. All algorithms are well-documented and typical researcher can start using the toolbox within minutes.
By donating your bookmarks, you let GiveALink analyze your preferences along with those of many other people. We will mine the resulting collection for interesting insights and use the information to develop novel applications. We will also share bookmark data with the Web research community, hoping to foster the development of many novel Web mining techniques and applications to search, recommendation, navigation, personalization and visualization of the Web.
W. Xi, E. Fox, W. Fan, B. Zhang, Z. Chen, J. Yan, and D. Zhuang. SIGIR '05: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, page 130--137. New York, NY, USA, ACM, (2005)