Index
a
A*-based optimal GED computation 119
Ackermann's function 188
activity spreading 254
acyclic cubical complex 342
addition 354
adjacency matrix 4ff., 25ff., 145
AIDS database 127
Albert–Barabasi limit 35
algorithm
– breadth-first search (BES) 236
– Dijkstra's 190
– dynamic programming (DP) 278
– Hungarian 122f.
– Kuhn-Munkres' 122f.
– minimum cost dynamic multicommodity flow problem 394
– optimal 118
– optimal dynamic flow 377ff.
– spanning peripheral arcs 201
– spanning peripheral edge 186
– suboptimal 121
Alon–Milman theorem 64
analytic combinatorics 425ff.
m-antiprism 359ff.
– downward 199
– kernel 199
– lateral 199
– peripheral 199
– reflexive 199
– upward 199
assignment problem 121
authority, network 13
automatic protein prediction 114
– computation 7
– abelian 5
average shortest path (ASP) 247, 256ff.
b
BABEL 231f.
Bacillus subtilis 282ff.
balanced incomplete block design (BIBD) 153
base graph 387
basic interval 302
basis problem 318
basis system
– complete 318
– problem 296
batch machine 301
batch machine scheduling (BMS) problem 301f.
Beamsearch(s), Beam(s) 121, 133
benzenoid hydrocarbon 154
betweenness 206
betweenness centrality (BC) 15ff., 52, 58
– vector 17f.
binary choice model 413
biological network 68
biometric person identification 114
bipartite edit distance 133
bipartite graph 149
bipartite graph matching 121
bipartite (BP) method 125ff.
bipartite model 213
bipartite network, community
Get Analysis of Complex Networks now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
