'Advanced Network Analysis / Pajek: Large ... - Vladimir Batagelj

More documents

Recommendations

Info

V. Batagelj: Analysis and visulization of large networks with Pajek 5 ✬ ✫ Large Networks Large network – several thousands or millions of vertices. Can be stored in computer’s memory – otherwise huge network. Usually sparse m
V. Batagelj: Analysis and visulization of large networks with Pajek 6 ✬ ✫ Complexity of algorithms From some thousands to some (tens) millions of units (vertices). Let us look to time complexities of some typical algorithms: T(n) 1.000 10.000 100.000 1.000.000 10.000.000 LinAlg O(n) 0.00 s 0.015 s 0.17 s 2.22 s 22.2 s LogAlg O(n log n) 0.00 s 0.06 s 0.98 s 14.4 s 2.8 m SqrtAlg O(n √ n) 0.01 s 0.32 s 10.0 s 5.27 m 2.78 h SqrAlg O(n 2 ) 0.07 s 7.50 s 12.5 m 20.8 h 86.8 d CubAlg O(n 3 ) 0.10 s 1.67 m 1.16 d 3.17 y 3.17 ky For the interactive use on large graphs already quadratic algorithms, O(n 2 ), are too slow. Methodenforum der Fakultät für Sozialwissenschaften, Universität Wien, 21-22. 6. 2007 ▲ ❙ ▲ ▲ ● ❙ ▲ ▲ ☛ ✖ ▲ ✩ ✪
Page 1 and 2: ✬ Vienna, St. Stephen’s Cathedr
Page 3 and 4: V. Batagelj: Analysis and visulizat
Page 7: V. Batagelj: Analysis and visulizat
Page 59 and 60:
V. Batagelj: Analysis and visulizat
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
show all

'Advanced Network Analysis / Pajek: Large ... - Vladimir Batagelj

Create successful ePaper yourself

Delete template?

Save as template?