2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/130012Small-worlds represent efficient communication networks that obey two distinguishing characteristics: a high clustering coefficient together with a small characteristic path length. This paper focuses on an interesting paradox, that removing links in a network can increase the overall clustering coefficient. Reckful Roaming, as introduced in this paper, is a 2-localized algorithm that takes advantage of this paradox in order to selectively remove superfluous links, this way optimizing the clustering coefficient while still retaining a sufficiently small characteristic path length.To appear in: 1st International Workshop on Localized Algorithms and Protocols for Wireless Sensor Networks (LOCALGOS 2007), 2007, IEEE Compuster Society PressNetworking and Internet ArchitectureDistributed, Parallel, and Cluster ComputingData Structures and Algorithmstext