LaNet-vi provides images of large scale networks on a two-dimensional layout. The algorithm is based on the k-core decomposition. For more details see http://xavier.informatics.indiana.edu/lanet-vi/ .
Be the first to post a text review of LaNet-vi (Large Network visualization). Rate and review a project by clicking thumbs up or thumbs down in the right column.
Changes: -------- LaNet-vi 2.1.2 - Improvements on weighted graphs algorithm. - Extension of cliques decomposition to every central core of a connected component. - Use of hashing to access the graph nodes faster. LaNet-vi 2.1.1 - Weighted graphs (weights are float numbers assigned to each edge). - Improvements on node names algorithm. LaNet-vi 2.1.0 - Central core decomposed into cliques. New algorithm for cliques disposition on circular sectors. - k-core-connectivity analysis. - Nodes are positioned taking into account its neighbours' positions, so that the cliques in the central core organize the deployment of the whole graph. - Nodes labeling. - SVG compatibility, with option for edges' transparency (only for Linux now). LaNet-vi 2.0.4 - Improved display of degree references - Solved problem that appeared when networks didn't have nodes in the first cores. - Solved problem when displaying all edges (they were not all shown even if edges was 1.0, reported by Duygu Balcan) LaNet-vi 2.0.3 - Solved stack overflow bug for big networks when computing clusters. LaNet-vi 2.0.2 - Resolved conflict with povray when an edge extremes were coincident (Reported by Frank E. Walter) LaNet-vi 2.0.1 - k-core decomposition file with (node,shell-index) added - Visualizer to look and zoom the generated png files. Java JVM is needed to use this feature. - Compatibility with Network Workbench (NWB) format (http://nwb.slis.indiana.edu). - Version for MS Windows added - Improvements on input file parsing
Changes: -------- LaNet-vi 2.1.2 - Improvements on weighted graphs algorithm. - Extension of cliques decomposition to every central core of a connected component. - Use of hashing to access the graph nodes faster. LaNet-vi 2.1.1 - Weighted graphs (weights are float numbers assigned to each edge). - Improvements on node names algorithm. LaNet-vi 2.1.0 - Central core decomposed into cliques. New algorithm for cliques disposition on circular sectors. - k-core-connectivity analysis. - Nodes are positioned taking into account its neighbours' positions, so that the cliques in the central core organize the deployment of the whole graph. - Nodes labeling. - SVG compatibility, with option for edges' transparency (only for Linux now). LaNet-vi 2.0.4 - Improved display of degree references - Solved problem that appeared when networks didn't have nodes in the first cores. - Solved problem when displaying all edges (they were not all shown even if edges was 1.0, reported by Duygu Balcan) LaNet-vi 2.0.3 - Solved stack overflow bug for big networks when computing clusters. LaNet-vi 2.0.2 - Resolved conflict with povray when an edge extremes were coincident (Reported by Frank E. Walter) LaNet-vi 2.0.1 - k-core decomposition file with (node,shell-index) added - Visualizer to look and zoom the generated png files. Java JVM is needed to use this feature. - Compatibility with Network Workbench (NWB) format (http://nwb.slis.indiana.edu). - Version for MS Windows added - Improvements on input file parsing
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
Thanks for your rating!
Would you also like to write a review?