Networks 1996: Vol 27 Index

3 Pages·1996·0.48 MB·English

NETWOKHS
AN INTERNATIONAL JOURNAL
Author Index to Volume 27, 1996
Agrawal, D. P.: see Chung, T. Y. Khachatrian, L. H.: see Ahlswede. R.
Ahlswede, R., Gargano, L., Haroutunian, H. S., and Khachatrian, Kishimoto, W.: A Method for Obtaining the Maximum Multiroute
L. H.: Fault-Tolerant Minimum Broadcast Networks, 293 Flows in a Network, 279
Ku, H.-K.: Optimally Edge Fault-Tolerant Trees, 203
Blanchini, F., Queyranne, M., Rinaldi, F., and Ukovich, W.: A
Feedback Strategy for Periodic Network Flows, 25 L^bbe. M.: see Dell’Amico, M.
Laforest. C.: see Fraigniaud. P.
Chlebus, B. S., Diks, K., and Pelc, A.: Broadcasting in Synchronous
Networks with Dynamic Faults, 309 Mafholi, F.: see Dell’Amico, M.
Choi, H.-A.: see Park, J.-Y. L. Melachrinoudis, E., and Helander, M. E.: A Single Facility Location
Chung, T. J.; see Chung, T. Y. FYoblem on a Tree with Unreliable Edges. 219
Chung, T. Y, Agrawal, D. P., Rai, S., and Chung, T. J.: A Mirchandani. P.: A Simple O(n-) Algorithm for the All-Pairs
Comparative Study of Doubly Connected Directed Topologies for Shortest Path Problem on an Interval Graph, 215
LANs and MANs, 35
Nobert, Y., and FMcard, J.-C.: An Optimal Algorithm for the Mixed
Dean, T.: see Greenwald, L. Chinese Postman FYoblem, 95
Dell’Amico, M., Labbe, M., and Maffioli, F.: Complexity of
Spanning Tree Problems with Leaf-Dependent Objectives, 175 Park, J.-Y. L., and Choi, H.-A.: Circuit-Switched Rowolumn
Diks, K.: see Chlebus, B. S. Broadcasting in Torus and Mesh Networks, 159
Diks, K., and Pelc, A.: Broadcasting with Universal Lists, 183 Pelc, A.: see Chlebus, B. S.; Diks, K.
Penn. M.: see Granot, F.
Petingi, L., Saccoman, J. T., and Schoppmann. L.: Uniformly Least
Ellis, J. A.; Embedding Grids into Grids: Techniques for Large
Reliable Graphs. 125
Compression Ratios, 1
fhcard, J.-C.: see Nobert, Y.
Polychronopoulos, G. H., and Tsitsiklis. J. N.: Stochastic Shortest
Fraigniaud, P., and Laforest, C.: Minimum Gossip Bus Networks, 239
Path FYoblems with Recourse, 133
Gargano, L.; see Ahlswede, R. Queyranne, M.: see Blanchini. F.; Granot, F.
Gavish, B., and Sridhar, S.: Erratum: Computing the 2-Median on
Tree Networks in 0(n Ig n) Time, 169 Rai, S.; see Chung, T. Y.
Granot, F., Penn, M., and Queyranne, M.: Disconnecting Sets in Rail. D.: see Gunther. G.
Single and Two-Terminal-Pair Networks, 117 Rinaldi, F.: see Blanchini, F.
Greenwald, L., and Dean, T.: Package Routing in Transportation
Networks with Fixed Vehicle Schedules, 81 Saccoman, J. T.: see Petingi, L.
Gunther, G., Hartnell, B., and Rail, D.: Star-Factors and k-Bounded Schoppmann. L.: see Petingi, L.
Total Domination, 197 Sridhar, S.: see Gavish, B.
Sritharan, R.: A Linear Time Algorithm to Recognize Circular
Harary, F., and Hayes, J. P.: Node Fault Tolerance in Graphs, 19 Permutation Graphs. 171
Haroutunian, H. S.: see Ahlswede, R. Sung. T.-Y.: see Ho. T.-Y.; Hung. C.-N.
Hartnell, B.: see Gunther, G.
Hayes, J. P.: see Harary, F.; Ku, H.-K. Talluri, K. T.: Network Synthesis with Few Edges, 109
Helander, M. E.: see Melachrinoudis, E. Tsitsiklis, J. N.; see Polychronopoulos, G. H.
Ho, T.-Y., Hsu, L.-H., and Sung, T.-Y.: Transmitting on Various
Network Topologies, 145 Ukovich, W.: see Blanchini, F.
Hotzel, E.: Components and Graph Automorphisms of Standard 2 X Underwood, A.: A Modified Melzak lYocedure for Computing Node-
2-Switch Banyan Networks, 53 Weighted Steiner Trees, 73
Hsu, L.-H.: see Ho, T.-Y.; Hung, C.-N.
Hung, C.-N, Hsu, L-H., and Sung, T.-Y.: A Response to Volgenant’s Volgenant, A.: An Addendum to the Most Vital Edges of Matching
Addendum on the Most Vital Edges. 255 in a Bipartite Graph, 253
Ishigami, Y.: The Wide-Diameter of the n-Dimensional Toroidal Yan, S.: Approximating Reduced Costs under Degeneracy in a
Mesh, 257 Network IHow FYoblem with Side Constraints. 267
NETWORKS, Vol. 27, (1996) 321
AN rNTERNATIONAL JOURNAL
Subject Index to Volume 27, 1996
Accumulation trees, 239 Global spare node, minimizing, 19
All-terminal reliability, undirected graph, 125 Gomory and Hu’s algorithm, 109
APPRCOST, 267 Gomory cuts, 95
Approximation algorithms, 159 Gossiping, 239
Automorphism, banyan networks, 53 Graphs
bipartite, most vital edges of matching (addendum), 253
Banyan networks, 2 X 2-switch, 53 edge-connectivity, 309
Binary trees, transmitting on, 145 fault-tolerant broadcasting, 293
Blossom inequalities, 95 k-regular k-connected, wide-diameter, 257
Broadcast networks, fault-tolerant minimum, 293 node fault tolerance, 19
Broadcast trees, 293 with random arc costs, 133
Broadcasting, 293 Grid-to-grid embedding problem. I
synchronous networks, with dynamic faults, 309 Grids
with universal lists, 183 broadcasting time, 183
Bus networks, minimum gossip, 239 embedding into grids, I
Gusheld's algorithm. 109
Capacity constrained package transfer problem, 81
HAMILTONIAN PATH, 175
Certainty equivalent heuristic, 133
Homomorphism, 53
Chinese Postman Problem, mixed, algorithm, 95
Host processor, 145
Circulant digraphs, 35
Hypercube, wide-diameter, 257
Circular permutation graphs, linear time algorithm, 171
Commodity distribution system, discrete-time network model, 25
Integer network synthesis problem, 109
Compression ratios, large, I
Interconnection networks, architecture, 145
Cut ranking problem, 117
Interval graph, all-pairs shortest path problem, 215
de Bruijn digraphs. 35
Lagrangian relaxation, 267
de Bruijn graphs, transmitting on, 145
Leaf-median problem, 175
Decomposition formula, 219
Line iteration digraphs, 35
Degeneracy, in network flow problems with side constraints, 267
Linear arrays, transmitting on, 145
Diagonal meshes, transmitting on, 145
Linear time algorithm, circular permutation graphs. 171
Directed graph, bipartite. 197
Link failure, dynamic, broadcasting time, 309
Doubly linked networks, 35
list blocks A and B, I
Local area networks, doubly connected directed topologies, 35
Edge fault-tolerant trees, optimally, 203 Loop networks, directed circulant, 35
Edge-m-route flows, maximum value, 279
Edges Manhattan street network, 35
critical, 203 Marriage Theorem, generalization, 197
most vital, 253, 255 Max-flow min-cut theorem, 109, 117
Embedding, into thick or thin strips, I m-route flow, 279
Medium access protocol, 35
Facility location algorithm. 219 Melzak procedure, modified, node-weighted Steiner trees, 73
Factoring theorem. 125 Menger’s theorem, generalization, 279
Failure probabilities, 125 Mesh, circuit-switched row-column broadcasting, 159
Fault-tolerant minimum broadcast networks. 293 Metropolitan area networks, doubly connected directed topologies, 35
Fault-tolerant multiprocessor systems, 203 Minimum broadcast graph, 239
Feedback, strategy for periodic network flows, 25 Minimum gossip graph, 239
Fiber Data Distributed Interface. 35 Mixed cutset, 117
Floyd-Warshall algorithm, 219 Mixed networks, disconnecting sets, 117
Folding with compression, I Modified buddy property, 53
Folding with extension, I Multicommodity flow problem, mixed integer/linear program
Forward loop backward loop network. 35 formulation, 81
322 NETWORKS, Vol. 27, (1996)
SUBJECT INDEX 323
Multicommodity problems, disconnecting sets, 117 Spanning tree problems, leaf-dependent objectives, 175
Multiroute flows, maximum, 279 s-t mixed cutsets, 117
Multiterminal cut problem, 117 Star packing, k-bounded. 197
Star trees, transmitting on, 145
Naive adaptive heuristic, 133 Stars, edge fault-tolerant, 203
Network flow model, dynamic, 25 Steiner points, 73
Network flow problem, with side constraints, approximating reduced Steiner trees, node-weighted, modified Melzak procedure, 73
costs, 267 Submodular flow problem, 25
Network location models, 219 Supergraphs, critical, 203
Node fault tolerance, graphs, 19 Swing Surgery, 125
Nonhomogeneous symmetric tree, 19 Synchronous networks, with dynamic faults, broadcasting, 309
Nonloop networks, 35
Target tubes, 25
Objective functions, leaf-dependent, spanning tree problems, 175 Telegraph model, 239
Omega network, 53 Telephone model, 239
O(n^) algorithm, 219 Threshold graph, 125
all-pairs shortest path problem, 215 Topology
0(/i’) algorithm, 219 doubly connected directed, 35
most vital edges of matching, 253 transmitting on, 145
Open loop feedback heuristic, 133 Toroidal mesh, n-dimensional, 2^'’
Torus
Package routing, transportation networks with fixed vehicle schedules, broadcasting, 183, 309
81 circuit-switched row-column broadcasting, 159
Path-stripping phase, 81 Tower building problem, I
Periodic network flows, feedback strategy, 25 Trailer network, 267
Permutation graph, circular, 171 Transmission, network topologies, 145
Polyhedra, 0-base, 25 Transmitting scheme, 145
Pseudo-manhattan graph, 95 Transportation networks, with fixed vehicle schedules, 81
Traveling Salesman Problem, reduction of mixed Chinese Postman
Random networks, 133 Problem, 95
Randomized rounding, 81 Trees
Recognition algorithm, 171 2-median computing (erratum), 169
Reduced costs, approximating, under degeneracy, 267 broadcasting time, 183
Relisum problem, 219 edge fault-tolerant, 203
Rings with unreliable edges, 219
broadcasting time, 183 Two-pair multicommodity problems, disconnecting sets, 117
transmitting on, 145
Routing, row-column, 159 Universal-list model, broadcasting, 183
Routing algorithms, 35 Undirected graph, all-terminal reliability, 125
Undirected network
S-disconnecting set, 117 maximum multiroute flows, 279
Sensitivity analysis, 219, 267 two-pair problem, 117
Set constraints, balanced, 95 Unit compression patterns, I
Sets, disconnecting, in single and two-terminal-pair networks, 117 Upper bounds, tightness, 309
Shortest path problem
all-pairs, 215 Vertex-m-route flows, maximum value, 279
stochastic, with recourse, 133 Vertex optimality conditions, 219
Simplex methods, 267
Single facility location problem, tree with unreliable edges, 219 Windy Postman Problem, applied to mixed Chinese Postman
Skewed 2-tiles, 1 Problem, 95