Networks 1991: Vol 21 Index

9 Pages·1991·0.96 MB·English

networks
an international journal
Volume 21, 1991
numbers 1-7
an Interscience® Publication
published by John Wiley & Sons
New York • Chichester • Brisbane • Toronto • Singapore
networks an international journal
EDITOR-IN-CHIEF EDITORS MANAGING EDITOR
F. T. BOESCH 1. T. FRISCH C. L. SUFFEL
Stevens Institute of Polytechnic University Department of Mathematics
Technology 333 Jay St. Stevens Institute of
Hoboken, NJ 07030 Brooklyn, NY 11201 Technology
[phone] Hoboken, NJ 07030
D. J. KLEITMAN
Department of Mathematics
MIT
Cambridge, MA 02139
ASSOCIATE EDITORS
M. Ball B. Golden Y. Perl
0. Bauer M. D. Grigoriadis J. S. Provan
J. C. Bermond J. N. Hagstrom A. Satyanarayana
J. Bruno H. Heffes P. Slater
S. A. Burr F. Hsu K. Steiglitz
S. Chen E. Minieka K. Sutner
C. Colbourn A. Nagurney D. Towsley
U. Derigs R. Oppenheim R. Van Slyke
ADVISORY EDITORS
1. Cederbaum S. L. Hakimi E. S. Kuh
G. B. Dantzig F. Harary M. Schwartz
R. Erdos M. Iri H. L. Van Trees
H. Frank R. E. Kahn L. Weinberg
D. Gazis R. Karp L. A. Zadeh
0. Gillette D. Kettler
R. L. Graham L. Kleinrock
ASSISTANT MANAGING EDITOR BOOK REVIEW EDITOR 1
Rose Pehrson J. G. Klincewicz
Dean of the Faculty’s Office Bell Telephone Laboratories
Stevens Institute of Technology Holmdel, NJ 07733
Hoboken, NJ 07030
Networks (ISSN: 0028-3045) is published seven times a ter the following issue has been received. Please enclose a
year: Jan., March, May, July, Aug., Oct., and Dec., one copy of the mailing label or cite your subscriber reference
volume per year, by John Wiley & Sons, Inc., 605 Third number in order to expedite handling. Missing copies will
Avenue, New York, NY 10158. be supplied when losses have been sustained in transit
Copyright ® 1991 by John Wiley & Sons, Inc. All rights and where reserve stock permits,
reserved. Reproduction or translation of any part of this Postmaster: Send address changes to Networks, Susan
work beyond that permitted by Sections 107 and 108 of the Malawski, Fulfillment Manager, Subscription Department,
U.S. Copyright Law without the permission of the copy- John Wiley & Sons, Inc., 605 Third Avenue, New York, NY
right owner is unlawful. Second-class postage paid at New 10156. For subscription inquiries, please call customer
York, NY, and at additional mailing offices. service at [phone] or write to the above address.
The code and the copyright notice appearing at the bot- Advertising Sales: Inquiries concerning advertising
tom of the first page of an item in the journal indicate the should be forwarded to Roberta Frederick, Advertising
copyright holder's consent that copies may be made for Sales, John Wiley & Sons, 605 Third Avenue, New York
personal or internal use, or for the personal or internal use 10158, [phone]. Advertising Sales, European Con-
of specific clients, on the condition that the copier pay for tact: Michael Levermore, Advertising Manager, John Wiley
copying beyond that permitted by Sections 107 and 108 of & Sons, Ltd., Baffins Lane, Chichester, Sussex P019 lUD,
the United States Copyright Law. The per-copy fee for England.
each item is $4.00 and is to be paid through the Copyright Manuscripts should be submitted to the Managing Edi-
Clearance Center, Inc., 21 Congress St., Salem, MA 01970. tor. Professor C. L. Suffel, Department of Mathematics,
This consent does not extend to other kinds of copying, Stevens Institute of Technology, Hoboken, NJ 07030. Infor-
such as copying for general distribution, for advertising or mation for contributors appears in the first and last issue
promotional purposes, for creating new collective works, of each volume. All other correspondence should be ad-
or for resale. Such permission requests and other permis- dressed to: Networks, Publisher, Interscience Division,
Sion inquiries should be addressed to the Permissions Professional, Reference, and Trade Group, John Wiley &
Dept. Sons, Inc., 605 Third Avenue, New York, NY 10158.
Subscription price (1991): $325.00 U.S.A.; $394.50 out- The contents of this journal are indexed in the following:
side U.S.A. (includes postage and handling). Back vol- Compumath, Computers and Control Abstracts, Comput-
umes, microfilm, and microfiche are available for previous ing Reviews, Current Contents/Engineering Technology
years: requested price list from publisher. Please allow and Applied Sciences, Electrical and Electronic Abstracts,
four weeks for processing a change of address. and Mathematical Reviews.
Claims for undelivered copies will be accepted only af- Editorial Production, John Wiley: Don Simmons. Jr.
Networks
Subject Index to Volume 21,1991
Antichains, 487 Dual ascent algorithm, 469
Dual-ascent procedure, 667
Bellman—Ford—Moore label-correcting Dynamic breadth-first search algorithm, 29
algorithm, 29 Dynamic location problem, 313
Binary monotone system, 521
Bipartite graphs Edge-connectivity, graph, 245
inequalities, 51 Edge failures, 321
maximum matchings, 165 Edges
Bipartite network, 565 addition and deletion, 713
Bitran—Hax algorithm, 469 node weighted cuts, 505
Bivariate parametric analysis, 223
Blocking probability, 267
Facility locations, parametric analysis, 223
Boolean n-cube architecture, 267
Fault-tolerant design, star networks, 373
Branch-and-cut algorithm, 51
Folding-cube network, generalized, 267
Branch weight centroid, 11
Ford and Fulkerson theorem, 595
Capacitated minimum cost network flow
model, 689 Global convergence theorem, 109
Capacitated networks, maximum flows, 645 Gomory—Hu cut tree, 505
Capacitated p-median problem, 133 Graphical property, hereditary, 245
Centers, trees, 11 Graph invariants, relations, 421
Centroids, 11 Graphs
Chain graphs, capacitated facilities, 133 circular-arc overlap, 195
Communication reliability, 581 directed, 505
Conditional connectivity, 245 edge-connectivity, 245
Connectivity, 245 weighted undirected, 505
Continuum of link demands, 133
Crude Monte Carlo method, 775
Hamming distance, 595
Cut cone, 595
Hereditary properties, conditional graph
Cut metrics, 595
connectivity relative to, 245
Cut trees, 505
Hops, bounds on optimal and suboptimal, 387
Hypercube, embeddings, 595
Dependence, computations, 521
Hypercube architecture, enhanced, 267
DERIVCYC, 581
Hypermetricity, 595
Digraph, almost acyclic, 581
Directed networks, 645
Directed trees, reliability covering problem, llliac-type interconnection networks, 1
345 Inequalities, facet defining, 51
Disequilibrium problem, 109 Infinite families
Double loop networks, minimal diameter, 1, dense, I
387 optimal networks, 387
NETWORKS, Vol. 21 (1991) 801
802 SUBJECT INDEX
Karp—Orlin algorithm, 705 Parametric shortest path algorithm, 205
A:-centrum, II Period routing problem, multiphase approach,
k-gonal inequalities, 595 747
^-nucleus, 11 Phylogeny problem, 19
^-terminal reliability, 321 Pivot paths, 205
it-tree networks, partial, 321 (s,/ Planar networks, minimum flow problem,
767
Lagrangean dual, 667 Planar region, univariate parametric analysis,
Lagrange multipliers, 689 223
Lagrange relaxation, 689 Polak—Ribiere direction formula, 469
Lagrangian dual approach, quadratic Polyhedron, multiway cut, 51
networks, 469 Polynomial time algorithms,
Lee and Preparata’s algorithm, 257 circular-arcoverlap graphs, 195
L'-embeddability, 595 Poly topes, 595
Link delays, 295 Primal-dual algorithm, minimum average
Link weights, 295 weighted length circuit problem, 705
Lipschitz continuity, 565 Probabilistic graphs, uniformly optimal, 359
Local convergence theorem, 109 Probabilistic networks, maximum flows, 645
Procedure MFCL_BOUND, 775
Manhattan distance, 595
Market disequilibrium model, asymmetric, 109 Quadratic networks, lagrangian dual
Market model, 109 approach, 469
Maximum flows, probabilistic networks, 645 Quartile points, optimal hops, 387
Maximum independent number, series-parallel
networks, 457 Reduction paradigm, 321
MFTEST, 645 Reliability
Minimum average weighted length circuit communication, 581
problem, primal-dual algorithm, 705 computations, 521
Minimum-balance algorithm, 205 covering problem, 345
Minimum-balance problem, 205 pair-connected, 359
Minimum flow problem, (s,/ planar networks, partial /t-tree networks, 321
767 uniformly-most, 417
Minimum mean cycle problem, 205 uniformly optimal, 181
Minimum weight paths, time-dependent Resilience, partial A:-tree network, 321
networks, 295 Root vortex, communication, 581
Monte Carlo method, stochastic flow Routing algorithm, 267
networks, 775
Multicommodity flow, 595 Scenario aggregation algorithm, multistage
Multiphase approach, period routing problem, stochastic networks, 619
747 Scheduling, precedence constrained, 487
Multistage stochastic networks, scenario Semilattices, reliability covering problem, 345
aggregation algorithm, 619 Sensitivity analysis, O-I multiterminal
Multiterminal network, O-I flows, 713 network flows, 713
Multiterminal networks, 645 Series-parallel networks, maximum
Multiway cut polyhedron, 51 independent number, 457
Sharing problem, one- and two-commodity,
Negative cycles, 29 547
Network decomposition algorithm, 109 Shock model, 521
Network equilibrium models, 109 Shortest path. Euclidean, 257
Node failures, 321 Shortest path algorithms, using dynamic
breadth-first search, 29
Odd hole inequalities, 51 Spanning forests, balanced, 667
Oligopolistic market equilibrium problem, 565 Spanning trees
balanced, 667
Pair-connected reliability, 359 strong, 165
Parametric analysis, facility locations, 223 Standby model, 521
SUBJECT INDEX 803
Star networks, fault-tolerant design, 373 measure of centrality of vertex, 11
Stochastic flow networks, Monte Carlo strong spanning, 165
method, 775 univariate parametric analysis, 223
Stochastic networks, scenario aggregation Two-commodity sharing problem, 547
algorithm, 619 Two-dimensional partial orders, 487
Strong spanning trees, 165 Two-terminal network reliability analysis
problem, 775
Time complexity, 645
Time-dependent networks, minimum weight Undirected networks, 645
paths, 295 Uniformly-most reliable networks, 417
Timing specifications, consistency and Univariate parametric analysis, 223
satisfiability, 91 Upsets, 487
Transmission delay, minimizing, I
Trees Vehicle routing problem, 747
balanced spanning, 667 Vertex, measure of centrality, 11
compatibility problem, 19
determining compatibility, 19 Waveform timing specifications, 91
inequalities, 51 Wheel inequalities, 51
inferring evolutionary history, 19 Whitney’s inequalities, 245

Networks
Author Index to Volume 21,1991
Adlakha, V., Gladysz, B., and Kamburowski, Chopra, S., and Rao, M. R.: On the Multiway
J.; Minimum Flows in (5,/) Planar Cut Polyhedron, 51
Networks, 767
Alexopoulos, C., and Fishman, G. S.: Dawson, R. J., and Farrag, A. A.:
Characterizing Stochastic Flow Networks Fault-Tolerant Extensions of Star
Using the Monte Carlo Method, 775 Networks, 373
Ali, A. I., and Huang, C.-H.: Balanced Deza, M.; see Avis, D.
Spanning Forests and Trees, 667 Dutton, R. D.; see Brigham, R. C.
Amin, A. T., Siegrist, K. T., and Slater, P. J.;
On the Nonexistence of Uniformly Optimal Egeland, T., and Huseby, A. B.: On
Graphs for Pair-Connected Reliability, 359 Dependence and Reliability Computations,
Avis, D., and Deza, M.: The Cut Cone, L' 521
Embeddability, Complexity, and
Multicommodity Flows, 595 Farrag, A. A.: see Dawson, R. J.
Fishman, G. S.: see Alexopoulos, C.
Balinski, M. L., and Gonzalez, J.: Maximum Fujisawa, T.: see Kashiwabara, T.
Matchings in Bipartite Graphs Via Strong Fujiwara, O.; see Khang, D. B.
Spanning Trees, 165
Ball, M. O., Provan, J. S., and Shier, D. R.: Gahlinger, T.: see Brzozowski, J. A.
Reliability Covering Problems, 345 Gladysz, B.: see Adlakha, V.
Bermond, J.-C., and Tzvieli, D.; Minimal Goldfarb, D., Hao, J., and Kai, S.-R.:
Diameter Double-Loop Networks: Dense Shortest Path Algorithms Using Dynamic
Optimal Families, 1 Breadth-First Search, 29
Boesch, F. T., Li, X., and Suffel, C.: On the Gonzalez, J.: see Balinski, M. L.
Existence of Uniformly Optimally Reliable Gribbin, D.: see Russell, R. A.
Networks, 181 Gusfield, D.: Efficient Algorithms for Inferring
Brandeau, M. L., and Chiu, S. S.: Parametric Evolutionary Trees, 19
Analysis of Optimal Facility Locations, 223 Gusfield, D., and Naor, D.: Efficient
Brigham, R. C., and Dutton, R. D.: A Algorithms for Generalized Cut-Trees, 505
Compilation of Relations Between Graph
Invariants—Supplement 1, 421 Hagstrom, J. N.: Computing Rooted
Brzozowski, J. A., Gahlinger, T., and Communication Reliability in an Almost
Mavaddat, F.; Consistency and Satisfiability Acyclic Digraph, 581
of Waveform Timing Specifications, 91 Hao, J.: see Goldfarb, D.
Hsu, L.-H., and Wang, S.-Y.: Maximum
Chen, Y.-M., and Ramanan, P.: Euclidean Independent Number for Series-Parallel
Shortest Path in the Presence of Obstacles, Networks, 457
257 Huang, C.-H.: see Ali, A. 1.
Cheung, K. H.: see Myrvold, W. Huseby, A. B.: see Egeland, T.
Chiu, S. S.: see Brandeau, M. L.
Choi, S. B., and Somani, A. K.: The Ibaraki, T.: see Nagamochi, H.
Generalized Folding-Cube Network, 267 Ichimori, T., and Katoh, N.: A
NETWORKS, Vol. 21 (1991) 809
810 AUTHOR INDEX
Two-Commodity Sharing Problem on Page, L, B,: see Myrvold, W,
Networks, 547 Perry, J. E,: see Myrvold, W,
Provan, J, S.: see Ball, M, O,
Jin, D.: see Yang, C. Qui, Y,: Solution Properties of Oligopolistic
Network Equilibria, 565
Kai, S.-R.: see Goldfarb, D.
Kamburowski, J.: see Adlakha, V. Ramanan, P,: see Chen, Y,-M.
Kashiwabara, T., Masuda, S., Nakajima, K., Rao, M, R.: see Chopra, S.
and Fugisawa, T.: Polynomial Time Reid, K, B.: Centroids to Centers in Trees, 11
Algorithms on Circular-Arc Overlap Rizzo, T, P,: see Sherali, H. D.
Graphs, 195 Rom, R.: see Orda, A.
Katoh, N.: see Ichimori, T. Russell, R. A., and Gribbin, D,: A Multiphase
Khang, D. B., and Fujiwara, O.: Approximate Approach to the Period Routing Problem,
Solutions of Capacitated Fixed-Charge 747
Minimum Cost Network Flow Problems,
689 Sherali, H, D., and Rizzo, T, P.: Unbalanced,
Capacitated p-Median Problems on a Chain
Li, X.: see Boesch, F. T. Graph with a Continuum of Link Demands,
Lin, S. C., and Ma, E.: Sensitivity Analysis 133
of 0-1 Multiterminal Network Flows, 713 Shier, D. R,: see Ball, M. O.
Sidney, J, B., Sidney, S. J,, and Warburton,
Ma, E.: see Lin, S. C. A,: Average Properties of Two-Dimensional
Masuda, S.: see Kashiwabara, T. Partial Orders, 487
Mata-Monero, E.; Resilience of Partial J:-tree Sidney, S. J.; see Sidney, J. B,
Networks with Edge and Node Failures, Somani, A, K,: see Choi, S. B,
321 Suffel, C,; see Boesch, F, T,
Mavaddat, F.: see Brzozowski, J. A.
Mulvey, J. M., and Vladimirou, H.: Solving Taijant, R. E,: see Young, N. E.
Multistage Stochastic Networks: An Tzvieli, D,: Minimal Diameter Double-Loop
Application of Scenario Aggregation, 619 Networks. 1. Large Infinite Optimal
Myrvold, W., Cheung, K. H., Page, L. B., Families, 387
and Perry, J. E.: Uniformly-Most Reliable Tzvieli, D.: see Bermond, J.-C.
Networks Do Not Always Exist, 417
Ventura, J. A.: Computational Development
Nagamochi, H., and Ibaraki, T.; Maximum of a Lagrangian Dual Approach for
Flows in Probabilistic Networks, 645 Quadratic Networks, 469
Nagumey, A., and Zhao, L.: A Network Vladimirou, H.: see Mulvey, J. M.
Equilibrium Formulation of Market
Disequilibrium and Variational Inequalities, Wang, S.-Y.: see Hsu. L.-H.
109 Warburton, A.: see Sidney, J. B.
Nakajima, K.: see Kashiwabara, T.
Naor, D.; see Gusfield, D. Yang, C., and Jin, D.: A Primal-Dual
Algorithm for the Minimum Average
Oellermann, O. R.: Conditional Graph Weighted Length Circuit Problem, 705
Connectivity Relative to Hereditary Young, N. E., Taijant, R. E., and Orlin,
Properties, 245 J. B.: Faster Parametric Shortest Path
Orda, A., and Rom, R.: Minimum Weight Minimum-Balance Algorithms, 205
Paths in Time-Dependent Networks, 295
Orlin, J. B.: see Young, N, E. Zhao, L.: see Nagurney, A.
• r
1