default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 22
Volume 22, Number 1, January 1992
- Zevi Miller, Manley Perkel:
The steiner problem in the hypercube. 1-19 - R. Ravi, Madhav V. Marathe, C. Pandu Rangan:
An optimal algorithm to solve the all-pair shortest path problem on interval graphs. 21-35 - Erhan Erkut, Richard L. Francis, Arie Tamir:
Distance-constrained multifacility minimax location problems on tree networks. 37-54 - Frank K. Hwang, Dana S. Richards:
Steiner tree problems. 55-89 - Günter Rote:
The n-line traveling salesman problem. 91-108
Volume 22, Number 2, March 1992
- Fred S. Roberts
, Yonghua Xu:
On the optimal strongly connected orientations of city street graphs. III. Three east-west avenues or north-south streets. 109-143 - Anna Nagurney, Merritt Hughes:
Financial flow of funds networks. 145-161 - Umit Akinc, Kizhanatham Srikanth:
Optimal routing and process scheduling for a mobile service facility. 163-183 - James R. Yee, Frank Yeong-Sung Lin:
A routing algorithm for virtual circuit data networks with multiple sessions per O - D pair. 185-208 - Appajosyula Satyanarayana, L. Schoppmann, Charles L. Suffel:
A reliability-improving graph transformation with applications to network reliability. 209-216
Volume 22, Number 3, May 1992
- Arie Tamir, Timothy J. Lowe:
The generalized P-forest problem on a tree network. 217-230 - Horst A. Eiselt, Michel Gendreau, Gilbert Laporte:
Location of facilities on a network subject to a single-edge failure. 231-246 - Ramesh S. Sankaranarayana, Lorna K. Stewart:
Complexity results for well-covered graphs. 247-262 - John N. Tsitsiklis:
Special cases of traveling salesman and repairman problems with time windows. 263-282 - George G. Polak:
On a parametric shortest path problem from primal - dual multicommodity network optimization. 283-295 - Chung-Kuan Cheng:
The optimal partitioning of networks. 297-315
Volume 22, Number 4, July 1992
- Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Sequential information dissemination by packets. 317-333 - J. F. Weng:
Degenerate Gilbert - Steiner trees. 335-348 - Edward G. Coffman Jr., Edgar N. Gilbert:
Paths through a maze of rectangles. 349-367 - Ehab S. Elmallah:
Algorithms for K-terminal reliability problems with node failures. 369-384 - Erich Prisner:
Two algorithms for the subset interconnection design problem. 385-395 - James P. Kelly, Bruce L. Golden, Arjang A. Assad:
Cell suppression: Disclosure protection for sensitive tabular data. 397-417 - Shoshana Anily, Refael Hassin:
The swapping problem. 419-433
Volume 22, Number 5, August 1992
- Peter Hamburger, Raymond E. Pippert, William Douglas Weakley:
On a leverage problem in the hypercube. 435-439 - Andrzej Pelc:
Reliable communication in networks with Byzantine link failures. 441-459 - Komei Fukuda, Tomomi Matsui:
Finding all minimum-cost perfect matchings in Bipartite graphs. 461-468 - Luisa Gargano:
Tighter time bounds on fault-tolerant broadcasting and gossiping. 469-486 - Xiao-Dong Hu, Frank Kwang-Ming Hwang:
Reliabilities of chordal rings. 487-501 - E. Andrew Boyd:
A pseudopolynomial network flow formulation for exact knapsack separation. 503-514
Volume 22, Number 6, October 1992
- Ramon Rabinovitch, Arie Tamir:
On a tree-shaped facility location problem of Minieka. 515-522 - Tuvi Etzion, Israel Bar-David:
An explicit construction of Euler circuits in shuffle nets and related networks. 523-529 - J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng:
Degree-five Steiner points cannot reduce network costs for planar sets. 531-537 - Ron Ben-Natan, Amnon Barak:
Parallel contractions of grids for task assignment to processor networks. 539-562 - Pedro I. Rivera-Vega, Ravi Varadarajan, Shamkant B. Navathe:
Scheduling file transfers in fully connected networks. 563-588 - Patrick Jaillet:
Shortest path problems with node failures. 589-605 - Ehab S. Elmallah, Charles J. Colbourn:
Series-parallel subgraphs of planar graphs. 607-614
Volume 22, Number 7, December 1992
- László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp:
Networks communicating for each pairing of terminals. 615-626 - Hyeong-Ah Choi, Abdol-Hossein Esfahanian:
A message-routing strategy for multicomputer systems. 627-646 - Wendy J. Myrvold:
Counting k-component forests of a graph. 647-652 - Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
Finding disjoint paths with different path-costs: Complexity and algorithms. 653-667 - Enrique Benavent, Vicente Campos, Angel Corberán, Enrique Mota:
The Capacitated Arc Routing Problem: Lower bounds. 669-690 - Jacob Shapiro, Jerry Waxman, Danny Nir:
Level graphs and approximate shortest path algorithms. 691-717
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-05-22 02:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
