default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 23
Volume 23, Number 1, January 1993
- Jason I. Brown
, Charles J. Colbourn, John S. Devitt:
Network transformations and bounding network reliability. 1-17 - Michel X. Goemans, Young-Soo Myung:
A catalog of steiner tree formulations. 19-28 - Lin Chen, Yaacov Yesha:
Efficient parallel algorithms for bipartite permutation graphs. 29-39 - Thomas R. Ervolina, S. Thomas McCormick:
Canceling most helpful total cuts for minimum cost network flow. 41-52 - Frank K. Hwang, Gaylord W. Richards:
A two-stage network with dual partial concentrators. 53-58 - Marina Moscarini:
Doubly chordal graphs, steiner trees, and connected domination. 59-69 - Jae-Moon Koh, Dong-wan Tcha:
Local broadcasting in a tree under minisum criterion. 71-79
Volume 23, Number 2, March 1993
- Lucio Bianco, Aristide Mingozzi, Salvatore Ricciardelli:
The traveling salesman problem with cumulative costs. 81-91 - Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita:
Graph endpoint coloring and distributed processing. 93-98 - Pierre Hansen, Maolin Zheng:
Sharp bounds on the order, size, and stability number of graphs. 99-102 - Thomas L. Magnanti, Prakash Mirchandani:
Shortest paths, single origin-destination network design, and associated polyhedra. 103-121 - Arthur L. Liestman, Thomas C. Shermer:
Grid spanners. 123-133 - Frank Harary, John P. Hayes:
Edge fault tolerance in graphs. 135-142 - G. M. Guisewite, Panos M. Pardalos:
A polynomial time solvable concave network flow problem. 143-147
Volume 23, Number 3, May 1993
- Lorenzo Traldi:
On the star - delta transformation in network reliability. 151-157 - Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman:
Decomposition of bipartite graphs under degree constraints. 159-164 - Klaus Jansen:
Bounds for the general capacitated routing problem. 165-173 - Gehan A. Corea, Vidyadhar G. Kulkarni:
Shortest paths in stochastic networks with ARC lengths having discrete distributions. 175-183 - Ashok T. Amin, Kyle Siegrist, Peter J. Slater:
On uniformly optimally reliable graphs for pair-connected reliability with vertex failures. 185-193 - Collette R. Coullard, Abdur Rais, Ronald L. Rardin, Donald K. Wagner:
Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs. 195-206 - Martin Farber, Mihály Hujter, Zsolt Tuza:
An upper bound on the number of cliques in a graph. 207-210
Volume 23, Number 4, July 1993
- D. Frank Hsu:
Introduction. 211-213 - Selim G. Akl, Ke Qiu, Ivan Stojmenovic:
Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry. 215-225 - Watcharaphong Ananchuen, Louis Caccetta:
On the adjacency properties of paley graphs. 227-236 - Erwin M. Bakker, Jan van Leeuwen:
Uniform d-emulations of rings, with an application to distributed virtual ring construction. 237-248 - Abdelmadjid Bouabdallah, Dominique Sotteau:
On the edge forwarding index problem for small graphs. 249-255 - Sheng Chen, Xing-De Jia:
Undirected loop networks. 257-260 - Wen-Shyen E. Chen, Kyungsook Y. Lee, Ming T. Liu:
μ-star: An indirect star network. 261-270 - Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Fault - tolerant hypercube broadcasting via information dispersal. 271-282 - Yahya Ould Hamidoune:
The minimum order of a cayley graph with given degree and diameter. 283-287 - Daryl D. Harms, Charles J. Colbourn:
Renormalization of two - terminal reliability. 289-297 - Jyun-Jy Hu, Shi-Nine Yang, Maw-Sheng Chern:
A unidirectional ring partition problem. 299-308 - Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
The most vital edges of matching in a bipartite graph. 309-313 - Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall:
A new class of interconnection networks based on the alternating group. 315-326 - Gyula O. H. Katona, Wojbor A. Woyczynski:
Optimization of the reliability polynomial in presence of mediocre elements. 327-332 - Roger Labahn:
Some minimum gossip graphs. 333-341 - Arthur L. Liestman, Thomas C. Shermer:
Additive graph spanners. 343-363 - Yuh-Dauh Lyuu:
Fast fault-tolerant parallel communication for de bruijn and digit-exchange networks using information dispersal. 365-378 - Dhiraj K. Pradhan, Fred J. Meyer:
Communication structures in fault-tolerant distributed systems. 379-389 - Mark Ramras:
Routing permutations on a graph. 391-398 - Hong Shen, Ralph-Johan Back:
Construction of large-size interconnection networks with high performance. 399-414 - Jerry L. Trahan, Suresh Rai:
Reliability evaluation and decision problems in extra stage shuffle-exchange MINs. 415-426 - Anujan Varma, Suresh Chalasani:
Asymmetrical multiconnection three-stage clos networks. 427-439 - Abdou Youssef:
Off-line permutation routing on circuit-switched fixed-routing networks. 441-448 - Qiao Li, Zhongliang Zhang, Junming Xu:
A very short proof of a conjecture concerning set-to-set broadcasting. 449-450
Volume 23, Number 5, August 1993
- Xiao-Dong Hu, Frank K. Hwang, Wen-Ch'ing Winnie Li:
Most reliable double loop networks in survival reliability. 451-458 - Edwin Hsing-Mean Sha, Kenneth Steiglitz:
Maintaining bipartite matchings in the presence of failures. 459-471 - Teresa W. Haynes, Linda M. Lawson:
Applications of E-graphs in network design. 473-479 - José A. Ventura, Xiaohua Weng:
A new method for constructing minimal broadcast networks. 481-497 - Paul Dagum, Eric Horvitz:
A Bayesian analysis of simulation algorithms for inference in belief networks. 499-516
Volume 23, Number 6, September 1993
- Dan Trietsch:
Optimal multifacility defensive location on planes with rectilinear distances. 517-523 - Kavindra Malik, Gang Yu:
A branch and bound algorithm for the capacitated minimum spanning tree problem. 525-532 - Arkady Kanevsky:
Finding all minimum-size separating vertex sets in a graph. 533-541 - S. Louis Hakimi, Edward F. Schmeichel, Martine Labbé:
On locating path- or tree-shaped facilities on networks. 543-555 - Byung-Wook Wie:
A differential game model of Nash equilibrium on a congested traffic network. 557-565 - Mark Hartmann, James B. Orlin:
Finding minimum cost to time ratio cycles with small integral transit times. 567-574
Volume 23, Number 7, October 1993
- Linos F. Frantzeskakis, Warren B. Powell:
Bounding procedures for multistage stochastic dynamic networks. 575-595 - Srinivas Y. Prasad, Rajan Batta:
Determining efficient facility locations on a tree network operating as a FIFO M/G/1 queue. 597-603 - Christos Alexopoulos, George S. Fishman:
Sensitivity analysis in stochastic flow networks using the Monte Carlo method. 605-621 - Richard A. Sandbothe:
Backordering in a multiperiod transshipment network. 623-630 - André Langevin, Martin Desrochers, Jacques Desrosiers, Sylvie Gélinas, François Soumis:
A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows. 631-640 - Vance Faber, James W. Moore, William Y. C. Chen:
Cycle prefix digraphs for symmetric interconnection networks. 641-649
Volume 23, Number 8, December 1993
- Dominique de Werra, Ph. Solot:
Some graph-theoretical models for scheduling in automated production systems. 651-660 - Éric D. Taillard:
Parallel iterative search methods for vehicle routing problems. 661-673 - S. Geetha, K. P. K. Nair:
On stochastic spanning tree problem. 675-679 - Brunilde Sansò, François Soumis:
The dynamic predicate stashing copy problem. 681-690 - Douglas M. Blough, Andrzej Pelc:
Optimal communication in networks with randomly distributed byzantine faults. 691-701 - Dimitri P. Bertsekas:
A simple and fast label correcting algorithm for shortest paths. 703-709
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 2025-10-22 02:15 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:
