Compressing Layout Algorithm for Large Complex Network Based on k-core
摘要
In order to optimize the visual layout effect of complex network while they become larger,by combining force-directed algorithm and k-core concept,this paper proposes an improved compressing lay algorithm for large complex network.The nodes are divided into various categories by k-core concept in a complex network,and they are handled in different ways by different k-core values.In this way,the scale of network nodes is decreased.In addition,this paper gives the definition of the compression oriented complex network information,which is used to measure the compressing effect quantitatively.Experimental results show that the proposed algorithm can effectively use limited display space,reduce the overlapping phenomenon in layout result,show the structure of the network clearly,and maintain the original network information.