2005 · 295 citations · 14 references
ComputingVisualizationData VisualizationGraph VisualizationNetwork VisualizationGraph DrawingGraph TheoryHierarchical Network VisualizationLarge Graph VisualizationNetwork AnalysisNetwork ExplorationComplex NetworksComputational Complexity Of AlgorithmsHierarchical Network StructureK-core DecompositionNetwork Topology VisualizationPruningTopological Fingerprints
We use the k-core decomposition to develop algorithms for the analysis of large scale complex networks. This decomposition, based on a recursive pruning of the least connected vertices, allows to disentangle the hierarchical structure of networks by progressively focusing on their central cores. By using this strategy we develop a general visualization algorithm that can be used to compare the structural properties of various networks and highlight their hierarchical structure. The low computational complexity of the algorithm, O(n + e), where n is the size of the network, and e is the number of edges, makes it suitable for the visualization of very large sparse networks. We show how the proposed visualization tool allows to find specific structural fingerprints of networks.
14
Statistical mechanics of complex networks
Réka Albert, Albert-Ĺaszló Barabási · Reviews of Modern Physics · 2002 · 20.6K citations · Full text
Heuristics for Internet map discovery
Ramesh Govindan, Hongsuda Tangmunarunkit · 2002 · 699 citations