Table Of Content

AN INTERNATIONAL JOURNAL Author Index to Volume 32,1998 Bandelt. H.-J., and Chepoi. V.: Embedding into the Rectilinear Grid, 127 Lucertini, M.: see Becker, R. Becker, Ronald, Lari, L, Lucertini, M., and Simeone, B.; Max-Min Parti¬ Liiling, R.: see Klasing. R. tioning of Grid Graphs into Connected Components, 115 Malesihska. E., Piskorz, S., and WeiBenfels, G.: On the Chromatic Number Chen, G.-H.: see Su, M.-Y. of Disk Graphs, 13 Chepoi, V.: see Bandelt, H.-J. Manor, R.. and Penn. M.: An Extended Planar Algorithm for Maximum Integral Two-Flow, 67 Drexl, A.; see Hartmann, S.; Kimms, A. Mans, B.; see Flocchini. P. Duh, D.-R.: see Su, M.-Y. Martin. A.: see Koch, T. Monien. B.: see Klasing. R. Fellows, M., Hell, P., and Seyffarth, K.; Constructions of Large Planar Moreno-Perez, J. A. Networks with Given Degree and Diameter, 275 Flocchini, P., Mans, B., and Santoro, N.: Sense of Direction: Definitions, Narayanan, L., and Shende, S.: Partial Characterizations of Networks Properties, and Classes, 165 Supporting Shortest Path Interval Labeling Schemes, 103 Gendreau, M., Laporte, G., and Semet, F.: A Branch-and-Cut Algorithm Penn, M.: see Manor, R. for the Undirected Selective Traveling Salesman Problem, 263 Perez-Brito, D.: see Tamir, A. Piskorz, S.: see Malesinska, E. Hall, N, G., Liu, W.-P., and Sidney, J. B.: Scheduling in Broadcast Networks, 233 Robins, G.: see Kahng, A. B. Hartmann, S,, and Drexl, A.: Project Scheduling with Multiple Modes: A Comparison of Exact Algorithms, 283 Santoro, N.: see Flocchini. P. Haynes, T. W., and Slater, P. J,: Paired-Domination in Graphs, 199 Semet. F.: see Gendreau, M. Hell, P.: see Fellows, M. Seyffarth, K.: see Fellows. M. Hsu, D. F., and Hu, X.-D,: On Shortest Two-Connected Steiner Networks Shende, S.: see Narayanan, L. with Euclidean Distance, 133 Sidney, J. B.: see Hall, N. G. Hu, X.-D.: see Hsu, D. F. Simeone, B.: see Becker, R. Slater, P. J.: see Haynes. T. W. Jwo, J.-S., and Tuan, T.-C.: On Container Length and Connectivity in Su. M.-Y., Chen, G.-H., and Duh, D.-R.: Topological Properties of Incom¬ Unidirectional Hypercubes, 307 plete WK-Recursive Networks, 23 Kahng, A. B., Robins, G., and Walkup, E. A.: How to Test a Tree, 189 Kimms, A., and Drexl, A.: Proportional Lot Sizing and Scheduling: Some Tamir, A., Perez-Brito. D., and Moreno-Perez, J. A.: A Polynomial Algo¬ Extensions, 85 rithm for the _p_-Centdian Problem on a Tree, 255 Klasing, R., Liiling, R., and Monien, B.: Compressing Cube-Connected Tay, E. G.: .see Koh, K. M. Cycles and Butterfly Networks, 47 Tham, Y. K.: Routing in Asymmetrical Multiconnection Three-Stage Clos Koch, T., and Martin, A.: Solving Steiner Tree Problems in Graphs to Networks, 77 Optimality, 207 Tobin, R. L.: see Wie, B.-W. Koh, K. M., and Tay, E. G.: On Optimal Orientations of Cartesian Products Tuan, T.-C.: see Jwo, J.-S. of Even Cycles, 299 Konig, J.-C., Krumme, D. W., and Lazard, E.; Diameter-Preserving Ori¬ Ueno. S.: see Yamada. T. entations of the Torus, 1 Krumme, D. W.; see Konig, J.-C. Walkup. E. A.: see Kahng, A. B. WeiBenfels, G.: see Malesihska. E. Laporte. G.: see Gendreau, M. Wie, B.-W., and Tobin. R. L.: On the Relationship between Dynamic Nash Lari, I.: .see Becker, R. and In.stantaneous User Equilibria, 141 Lazard, E.: see Konig, J.-C. Liu, W.-P.: see Hall, N. G. Yamada, T., and Ueno, S.: Fault-Tolerant Graphs for Tori, 181 NETWORKS, VOL. 32, (1998) 321 NETWOmB AN INTERNATIONAL JOURNAL Subject Index to Volume 32,1998 Algorithms Grid graphs, max-min partitioning. 115 high-low chain. 233 testing trees, 189 Hamiltonian cycle, 23 Heuristics, 115 Birkhoff-von Neumann theorem, 77 Hypercubes, unidirectional, 307 Bottleneck degree m test, 207 Bounding rules, 283 Implicit routing, 165 Branch-and-bound algorithms, comparison. 283 Instantaneous user equilibria, relationship with dynamic Nash, 141 Branch-and-cut algorithms Interval routing algorithms, 103 solving Steiner tree problems. 207 undirected Selective Traveling Salesman Problem, 263 Large networks, 275 Broadcast cycle time, 233 Local views, translation. 165 Broadcasting. 233 Butterfly networks, compressing, 47 Maximum integral two-flow, extended planar algorithm, 67 Max-min partitioning, grid graphs, 115 Cartesian products, orientations of even cycles, 299 p-Median problem, 255 p-Centdian problem, 255 Metric graphs. 181 p-Center problem, 255 Metric spaces, embedding, 127 Chain graphs, two-flows, 67 Metropolitan Area Networks, 307 Christofides’ heuristic, 133 Multichip module, 189 Chromatic number, disk graphs, 13 Multiple modes, 283 Clos network, asymmetrical multiconnection three-stage, 77 Colorings, disk graphs, 13 Nash equilibrium. 141 Computational complexity, max-min partitioning, 115 Network flow model, routing, 77 Connectivity, unidirectional hypercubes, 307 NP-complete, 233 Container length, unidirectional hyptercubes, 307 Cube-connected cycles, compressing, 47 Optimization, max-min partitioning, grid graphs. 115 Cutset Rule, 283 Order Swap Rule, 283 Orientations, diameter-preserving, torus, 1 Diameter, incomplete WK-recursive networks, 23 Orienteering, 263 Diameter-preserving orientations, toms, I Digraphs, Cartesian products, 299 Paired-domination, graphs, 199 Disk graphs, chromatic number, 13 Parallel and distributed computation theory, 103 Dynamic Nash, relationship with instantaneous user equilibria. 141 Planar networks, large, 275 Dynamic traffic assignment. 141 Polynomial algorithm, p-centdian problem, 255 Polynomial time algorithm, 233 Edge-coloring approach, 77 Processor-bound transmission. 233 Edge fault testing, 189 Project management, 283 Embedding, into rectilinear grid, 127 Project scheduling, 283 Euclidean plane, shortest two-connected Steiner networks, 133 Proportional lot sizing and scheduling problem, multilevel, 85 Extended planar algorithm, maximum integral two-flow, 67 Randomized regret-based sampling, 85 Fault-tolerant graphs, for tori, 181 Rectilinear grid, embedding into, 127 Remote views, translation, 165 GENIUS, 263 Resource-constrained project scheduling, 283 Graphs Routing disk. 13 asymmetrical multiconnection Clos network, 77 fault-tolerant, 181 network flow model, 77 paired-domination. 199 shortest path interval, 103 solving Steiner tree problems, 207 undirected. 1 Scheduling, 233 Graph theory, 103 with multiple modes, 283 GREEDY, 233 Selective Traveling Salesman Problem, undirected. 263 NETWORKS, VOL. 32, (1998) 323 324 SUBJECT INDEX Sense of direction, 165 diameter-preserving orientations, 1 Shifting algorithm, 115 fault-tolerant graphs, 181 Shortest path interval labeling schemes, 103 Translation, local views, 165 Special-distance-test, 207 Tree, testing, 189 Steiner networks, shortest two-connected, on Euclidean plane, 133 Steiner tree problems, solving in graphs, 207 Undirected graphs, orientation, 1 Terminal-distance-test, 207 Vertex and edge fault testing, 189 Time window rules, 283 Topological properties, incomplete WK-recursive networks, 23 Wardrop’s second principle, dynamic game theoretic generalization, 141 Torus WK-recursive networks, incomplete, topological properties, 23