Visualization of traffic structures
暂无分享,去创建一个
[1] Peter Eades,et al. A Heuristic for Graph Drawing , 1984 .
[2] Karl N. Levitt,et al. GrIDS A Graph-Based Intrusion Detection System for Large Networks , 1996 .
[3] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..
[4] Mitsuhiko Toda,et al. Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.
[5] Satoru Kawai,et al. An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..
[6] Dieter Jungnickel,et al. Graphen, Netzwerke und Algorithmen , 1987 .
[7] Duane Wessels,et al. Visualization of the Growth and Topology of the NLANR Caching Hierarchy , 1998, Comput. Networks.
[8] Boris Mirkin,et al. Mathematical Classification and Clustering , 1996 .
[9] Shiro Usui,et al. Neural Computing , 1989, IFIP Congress.
[10] Oliver Niggemann,et al. A Meta Heuristic for Graph Drawing. , 2000 .
[11] kc claffy,et al. Otter: A general-purpose network visualization tool , 1999 .
[12] Dorothy E. Denning,et al. An Intrusion-Detection Model , 1987, IEEE Transactions on Software Engineering.
[13] Richard M. Leahy,et al. An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..
[14] Thomas Lengauer,et al. Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.
[15] Peter Eades,et al. A Heuristics for Graph Drawing , 1984 .
[16] K. Pearson. Contributions to the Mathematical Theory of Evolution , 1894 .
[17] Benno Stein,et al. A meta heuristic for graph drawing: learning the optimal graph-drawing method for clustered graphs , 2000, AVI '00.
[18] Janet L. Kolodner,et al. Case-Based Reasoning , 1989, IJCAI 1989.
[19] David B. Leake. Case-based reasoning , 1994, The Knowledge Engineering Review.