Volume 7,
Number 1,
1992
Volume 7,
Numbers 2&3,
1992
- Frank K. Hwang:
Foreword.
119-120 BibTeX
- Ding-Zhu Du, Frank K. Hwang:
A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio.
121-135 BibTeX
- Warren D. Smith:
How To Find Steiner Minimal Trees in Euclidean d-Space.
137-177 BibTeX
- Zi-Cheng Liu, Ding-Zhu Du:
On Steiner Minimal Trees with L_p Distance.
179-191 BibTeX
- J. H. Rubinstein, D. A. Thomas:
Graham's Problem on Shortest Networks for Points on a Circle.
193-218 BibTeX
- Ernest J. Cockayne, Denton E. Hewgill:
Improved Computation of Plane Steiner Minimal Trees.
219-229 BibTeX
- R. S. Booth, J. F. Weng:
Steiner Minimal Trees for a Class of Zigzag Lines.
231-246 BibTeX
- Dana S. Richards, Jeffrey S. Salowe:
A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets.
247-276 BibTeX
- Sailesh K. Rao, P. Sadayappan, Frank K. Hwang, Peter W. Shor:
The Rectilinear Steiner Arborescence Problem.
277-288 BibTeX
- J. Scott Provan:
Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems.
289-302 BibTeX
- Charles J. Colbourn:
A Note on Bounding k-Terminal Reliability.
303-307 BibTeX
- Pawel Winter, J. MacGregor Smith:
Path-Distance Heuristics for the Steiner Problem in Undirected Networks.
309-327 BibTeX
- Warren D. Smith, Peter W. Shor:
Steiner Tree Problems.
329-332 BibTeX
- Stefan Voß:
Problems with Generalized Steiner Problems.
333-335 BibTeX
- Otfried Schwarzkopf:
Parallel Computation of Distance Transforms - Erratum.
337 BibTeX
Volume 7,
Number 4,
1992
Volume 7,
Numbers 5&6,
1992
Special Issue on Graph Algorithms
- Greg N. Frederickson:
Editor's Foreword Special Issue on Graph Algorithms.
429-431 BibTeX
- Jeffery Westbrook, Robert Endre Tarjan:
Maintaining Bridge-Connected and Biconnected Components On-Line.
433-464 BibTeX
- Harold N. Gabow, Herbert H. Westermann:
Forests, Frames, and Games: Algorithms for Matroid Sums and Applications.
465-497 BibTeX
- Dan Gusfield, Charles U. Martel:
A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications.
499-519 BibTeX
- Bhubaneswar Mishra, Robert Endre Tarjan:
A Linear-Time Algorithm for Finding an Ambitus.
521-554 BibTeX
- Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families.
555-581 BibTeX
- Hiroshi Nagamochi, Toshihide Ibaraki:
A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph.
583-596 BibTeX
- John H. Reif, Paul G. Spirakis:
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems.
597-630 BibTeX
- Joan M. Lucas, Marian Gunsher Sackrowitz:
Efficient Parallel Algorithms for Path Problems in Directed Graphs.
631-648 BibTeX
Copyright © Sat May 16 23:50:07 2009
by Michael Ley (ley@uni-trier.de)