AN INTERNATIONAL JOURNAL Volume Contents JANUARY 1994 VOLUME 24. NUMBER 1 Locating an Obnoxious Facility on a Euclidean Network to Minimize Neighborhood Damage 1 C. S. Sung and C. M. Joo Weighted k-Cardinality Trees: Complexity and Polyhedral Structure 11 M. Fischetti, H. W. Hamacher, K. Jernsten, and F. Maffiolio A New Characterization of Tree Medians with Applications to Distributed Sorting 23 O. Gerstel and S. Zaks Improving the Location of Minimax Facilities Through Network Modification 31 0. Berman, D. I. Ingco, and A. Odoni Use of Continuous Approximations within Discrete Algorithms for Routing Vehicles: Experimental Results and Interpretation 43 R. W. Hall. Y. Du, and J. Lin MARCH 1994 VOLUME 24, NUMBER 2 A Fast Algorithm for Bounded Generalized Processing Networks 57 J. D. Fuller and B. Lan An Efficient Graph Planarization Two-Phase Heuristic 69 0. Goldschmidt and A. Takvorian Forwarding Indices of Consistent Routings and Their Complexity 75 M. C. Heydemann, J. C. Meyer, D. Sotteau, and J. Opatrny Universal Minimal Total Dominating Functions in Graphs 83 E. J. Cockayne, C. M. Mynhardt, and B. Yu Sharper Analysis of Packet Routing on a Butterfly 91 A. Krishna, B. Hajek, and A. Pietracaprina Minimal-Distance Routing for KYKLOS II 103 D.-Z. Du, F. K. Hwang, A. M. Odiyzko, and Y. Zhang Edge-Maximal Triangulated Subgraphs and Heuristics for the Maximum Clique Problem 109 J. Xue Book Reviews 121 MAY 1994 VOLUME 24, NUMBER 3 Local Bipartite Tur^n Graphs and Graph Partitioning 131 J. Lee and J. Ryan Probabilistic Analysis of an Enhanced Partitioning Algorithm for the Steiner Tree Problem inR^ 147 K. Kalpakis and A. T. Sherman Stochastic Programs over Trees with Random Arc Capacities 161 IV. B. Powell and R. K. Cheung Mengerian Properties, Hamiltonicity, and Claw-Free Graphs 177 E. Flandrin and H. LI A Separation Decomposition for Orders 185 T. Kampke JULY 1994 VOLUME 24, NUMBER 4 A Degree Sequence Problem Related to Network Design 195 D. Bienstock and 0. GCInlUk Measures of Vulnerability—The Integrity Family 207 IV. Goddard A Delaunay Triangulation-Based Heuristic for the Euclidean Steiner Problem 215 J. E. Beasley and F. Goffinet On Super i-Connected Graphs 225 J. IV. Boland and R. D. Ringeisen Spanners in Graphs of Bounded Degree 233 L. Cal and M. Kell On Reliability of Graphs with Node Failures 251 0. Goldschmidt, P. Jaillet, and R. LaSota Note: The Diameter of Edge Domination Critical Graphs 261 M. Paris Note: Small Integral Flows Need Only Sparse Networks 263 /. Althofer AUGUST 1994 VOLUME 24, NUMBER 5 A Bad Submatrix Is Easy to Find 267 R. P. Swaminathan Computation of the Forwarding Index via Flows: A Note 273 W. Fernandez de le Vega and Y. Manoussakis A Proof of Boesch’s Conjecture 277 G. Wang Ripples, Complements, and Substitutes in Singly Constrained Monotropic Parametric Network Flow Problems 285 A. Gautier and F. Granot Maximum Likelihood Genetic Sequence Reconstruction from Oligo Content 297 J. N. Hagstrom, R. Hagstrom, R. Overbeek, M. Price, and L Schrage SEPTEMBER 1994 VOLUME 24, NUMBER 6 Topological Properties, Communication, and Computation on WK-Recursive Networks 303 G.-H. Chen and D.-R. Duh Applications of Matching and Edge-Coloring Algorithms to Routing in Clos Networks 319 J. D. Carpinelli and A. Y. Oruq Compressing Grids into Small Hypercubes 327 Z. Miller and I. H. Sudborough OCTOBER 1994 VOLUME 24. NUMBER 7 New Results for the Degree/Diameter Problem 359 M. J. Dinneen and P. R. Hafner A Network Recourse Decomposition Method for Dynamic Networks with Random Arc Capacities 369 W. B. Powell and R. K.-M. Cheung Personnel Shift Assignment: Existence Conditions and Network Models 385 Y. van den Berg and D. M. Panton Efficient Algorithms for Minimum Range Cut Problems 395 N. Katoh and K. Iwano DECEMBER 1994 VOLUME 24, NUMBER 8 Experimental Evaluation of a Partitioning Algorithm for the Steiner Tree Problem in and R^ 409 S. Ravada and A. T. Sherman Reliable Distributed Diagnosis for Multiprocessor Systems with Random Faults 417 P. Berman and A. Peic An Exact Lower Bound on the Number of Cut-Sets in Multigraphs 429 H. Harada, Z. Sun, and H. Nagamochi An Algorithm for Generating Minimum Cost Network Flow Problems with Specific Structure and Known Optimal Solutions 445 J. L. Arthur and J. 0. Frendewey, Jr. Author Index to Volume 24 457 Subject Index to Volume 24 459 Volume Contents I \- I ■