%0 Journal Article
%T Hybrid layout algorithm based on skeleton subgraph<br>基于主干子图的混合布局算法
%A ZHANG Wei-ming
%A ZHANG Kai
%A WANG Qing-xian
%A <br>张伟明
%A 张凯
%A 王清贤
%J 计算机应用
%D 2008
%I 
%X 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.
%K graph drawing
%K skeleton subgraph
%K power law
%K layout<br>绘图
%K 主干子图
%K 幂率
%K 布局
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=A94DBCD01D6A97F65901558A1C5CC493&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=0B39A22176CE99FB&sid=73648F51F187AC5E&eid=B9B90065CF5CD7F0&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=8