Algorithms for keeping connectivity and communication efficiency in Ad-hoc network...
Relationship between stability and complexity in ecological networks of stream com...
Approximation and parameterized algorithms for pair connectivity problems
| Full text | |
| Author(s): |
Rodrigues, Francisco Aparecido
;
Costa, Luciano da Fontoura
Total Authors: 2
|
| Document type: | Journal article |
| Source: | PHYSICAL REVIEW E; v. 81, n. 3, p. 10-pg., 2010-03-01. |
| Abstract | |
This article focuses on the identification of the number of paths with different lengths between pairs of nodes in complex networks and how these paths can be used for characterization of topological properties of theoretical and real-world complex networks. This analysis revealed that the number of paths can provide a better discrimination of network models than traditional network measurements. In addition, the analysis of real-world networks suggests that the long-range connectivity tends to be limited in these networks and may be strongly related to network growth and organization. (AU) | |
| FAPESP's process: | 05/00587-5 - Mesh (graph) modeling and techniques of pattern recognition: structure, dynamics and applications |
| Grantee: | Roberto Marcondes Cesar Junior |
| Support Opportunities: | Research Projects - Thematic Grants |