Koster A., Munoz X. Graphs and Algorithms in Communication Networks
Подождите немного. Документ загружается.
426 Index
assignment, 50, 52
binary, 27, 50–52, 209
binary arc routing, 234
binary link-flow, 225
binary path, 225
binary routing, 205, 230
capacity, 38, 39
logical link, 99
node, 99
physical link, 99
coverage, 51
defining shortest paths, 213
dual, 36, 214, 217, 223, 227
edge-flow, 34
flow, 32, 34, 100, 205
non-aggregated flow, 214
path length, 205
path-flow, 35
routing, 217, 224
SP, 211
SP tree, 225
violation, 50
weight, 205
VC method, 216
vertex coloring problem, 47, 290
k-colorable subgraph, 49
list coloring, 48
list-T-coloring, 48
T-coloring, 48
vertex connectivity, 6
vertex cover problem, 24
wakeup mode, 315
wakeup problem, 330
radio network, 330
waveband switching, 65
wavelength division multiplexing, 64
WDM, 64, 96, 200
weak budget balance, 252
weight vector, 203, 222
WiFi, see WLAN, 379
WiMAX, 379
wired network, 336
wireless gathering problem, 358
wireless network, 336, 378–400
WLAN, 4, 26, 46, 284, 378–400
working path, 31, 139
XTC, 405