Hybrid layout algorithm based on skeleton subgraph
基于主干子图的混合布局算法

We presented a novel hybrid layout algorithm based on skeleton subgraph, which could handle the power-law graph. The key idea was to decompose the original graph into a skeleton subgraph and several stub trees, and to layout them with different graph drawing algorithms. The experiments and analysis indicate that our algorithm outperforms the traditional K- K algorithm when the size of the graph is smaller than a certain constant, and the result seems to be easier to lead the user to identify the skeleton subgraph and the stub trees, and to understand the original graph.