Table Of Content

AN INTERNATIONAL JOURNAL AUGUST 1999 VOLUME 34, NUMBER 1 Volume Contents Deferred-Query: An Efficient Approach for Some Problems on Interval Graphs 1 M.-S. Chang, S.-L Peng, and J.-L. Liaw On the Memory Overhead of Distributed Snapshots 11 L Shabtay and A. Segall Path Problems in Networks with Vector-Valued Edge Weights 19 G. K. Tayi, D. J. Rosenkrantz, and S. S. Ravi Lower Bounds for Linear Interval Routing 37 T. Eilam, S. Moran, and S. Zaks Deadlock-Free Interval Routing Schemes 47 M. Flammini Optimal Edge Coloring of Large Graphs 61 J. Gomez and M. Escudero An Optimal Algorithm for Layered Wheel Floorplan Designs 67 P. D. Kulasinghe and S. Bettayeb A Competitive Analysis for Retransmission Timeout 73 S. Dolev, M. Kate, and J. L. Welch SEPTEMBER 1999 VOLUME 34, NUMBER 2 Optimal Tree 3-Spanners in Directed Path Graphs 81 H.-O. Le and V. B. Le An Efficient Implementation of an Algorithm for Finding K Shortest Simple Paths 88 E. Hadjiconstantinou and N. Christofides Analysis of LP Relaxations for Multiway and Multicut Problems 102 D. Bertsimas, C.-P. Teo, and R. Vohra Eccentric Graphs 115 G. Chartrand, W. Gu, M. Schultz, and S. J. Winters Optimum Requirement Spanning Trees and Reliability of Tree Networks 122 T. Anazawa, T. Kodera, and M. Jimbo On a Condition for Obtaining an Explicit Solution of Optimum Requirement Spanning Tree 132 T. Anazawa Greedy Online Algorithms for Routing Permanent Virtual Circuits 136 J. T. Havill and W. Mao New Large Graphs with Given Degree and Diameter Six 154 J. Gomez, I. Pelayo, and C. Balbuena A Tabu Search Heuristic for the Steiner Tree Problem 162 M. Gendreau, J.-F. Larochelle, and B. Sansd OCTOBER 1999 VOLUME 34, NUMBER 3 On Crossings, the Crossing Postman Problem, and the Rural Postman Problem 173 R. S. Garfinkel and I. R. Webb The Pilot Method: A Strategy for Heuristic Repetition with Application to the Steiner Problem in Graphs 181 C. Duin and S. VoB Tenacity of Complete Graph Products and Grids 192 S. A. Choudum and N. Priya On the Superconnectivity and the Conditional Diameter of Graphs and Digraphs 197 A. Carmona and J. Fabrega Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems 206 E. Kranakis, A. Peic, and A. Spatharis Crossing Properties of Multiterminal Cuts 215 R. F. Easley and D. Hartvigsen Modeling /C-Coteries by Well-Covered Graphs 221 M. Yamashita and T. Kameda Heuristic and Exact Algorithms for Scheduling Aircraft Landings 229 A. T. Ernst, M. Krishnamoorthy, and R. H. Storer DECEMBER 1999 VOLUME 34, NUMBER 4 Contents Special Issue: Centrality Concepts in Network Location Guest Editor: Dr. Fred Buckley Preface 243 F. Buckley A Survey of Sequences of Central Subgraphs 244 P. J. Slater Locations on Time-Varying Networks 250 S. L Hakimi, M. Labbe, and E. F. Schmeichel On Steiner Centers and Steiner Medians of Graphs 258 O. R. Oellermann Balance Vertices in Trees 264 K. B. Reid The Subtree Center of a Tree 272 J. Nieminen and M. Peltola Properties of Edge-Deleted Distance Stable Graphs 279 K. Klemm and S. J. Winters A Unified Approach to Network Location Problems 283 S. Nickel and J. Puerto Eulerian Location Problems 291 G. Ghiani and G. Laporte Center, Median, and Centroid Subgraphs 303 C. Smart and P. J. Slater Generalized Eccentricity, Radius, and Diameter in Graphs 312 P. Dankelmann, W. Goddard, M. A. Henning, and H. C. Swart Author Index to Volume 34 323 Subject Index to Volume 34 325 Volume Contents