Decomposing Social Networks
Social Computing（2010）
摘要
Networks having several hundred or more nodes and significant edge probabilities are extremely difficult to visualize. They typically appear as dense clumps, with the various subcomponents completely obscure. We illustrate a method for decomposing a network into aggregates of subgraphs whose topologies are represented as colors in RGB space.
更多查看译文
关键词
various subcomponents,decomposing social networks,dense clump,i introduction,rgb space,significant edge probability,color,social network,graph theory,topology,network topology,topologies,visualization
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要