Publications
You can also access our individual websites (via the Members page) for further information about our research and lists of our publications.
Results
- Showing results for:
- Reset all filters
Search results
-
Journal articleBui-Xuan B-M, Jones NS,
How modular structure can simplify tasks on networks
By considering the task of finding the shortest walk through a network wefind an algorithm for which the run time is not as O(2^n), with n being thenumber of nodes, but instead scales with the number of nodes in a coarsenednetwork. This coarsened network has a number of nodes related to the number ofdense regions in the original graph. Since we exploit a form of local communitydetection as a preprocessing, this work gives support to the project ofdeveloping heuristic algorithms for detecting dense regions in networks:preprocessing of this kind can accelerate optimization tasks on networks. Ourwork also suggests a class of empirical conjectures for how structural featuresof efficient networked systems might scale with system size.
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.