The graph drawing and information visualization communities have developed many sophisticated techniques for visualizing network data, often involving complicated algorithms that are difficult for the uninitiated to l...The graph drawing and information visualization communities have developed many sophisticated techniques for visualizing network data, often involving complicated algorithms that are difficult for the uninitiated to learn. This article is intended for beginners who are interested in programming their own network visualizations, or for those curious about some of the basic mechanics of graph visualization. Four easy-to-program network layout techniques are discussed, with details given for implementing each one： force-directed node-link diagrams, arc diagrams, adjacency matrices, and circular layouts. A Java applet demonstrating these layouts, with open source code, is available at http：//www.michaelmcguffin.com/research/simpleNetVis/. The end of this article also briefly surveys research topics in graph visualization, pointing readers to references for further reading.展开更多
By connecting the 5 vertices of K5 to other n vertices, we obtain a special family of graph denoted by Hn. This paper proves that the crossing number of Hn is Z（5, n） ＋2n＋ [n/2] ＋1, and the crossing number of Car...By connecting the 5 vertices of K5 to other n vertices, we obtain a special family of graph denoted by Hn. This paper proves that the crossing number of Hn is Z（5, n） ＋2n＋ [n/2] ＋1, and the crossing number of Cartesian products of K5 with star Sn is Z（5, n） ＋ 5n ＋ [n/2] ＋ 1.展开更多
基金Supported by the Natural Sciences and Engineering Research Council of Canada
文摘The graph drawing and information visualization communities have developed many sophisticated techniques for visualizing network data, often involving complicated algorithms that are difficult for the uninitiated to learn. This article is intended for beginners who are interested in programming their own network visualizations, or for those curious about some of the basic mechanics of graph visualization. Four easy-to-program network layout techniques are discussed, with details given for implementing each one： force-directed node-link diagrams, arc diagrams, adjacency matrices, and circular layouts. A Java applet demonstrating these layouts, with open source code, is available at http：//www.michaelmcguffin.com/research/simpleNetVis/. The end of this article also briefly surveys research topics in graph visualization, pointing readers to references for further reading.
基金the National Natural Science Foundation of China （No. 10771062） and New Century Excellent Talents in University.
文摘By connecting the 5 vertices of K5 to other n vertices, we obtain a special family of graph denoted by Hn. This paper proves that the crossing number of Hn is Z（5, n） ＋2n＋ [n/2] ＋1, and the crossing number of Cartesian products of K5 with star Sn is Z（5, n） ＋ 5n ＋ [n/2] ＋ 1.
