default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 18
Volume 18, Number 1, Spring 1988
- Charles J. Colbourn, Daryl D. Harms:
Bounding all-terminal reliability in computer networks. 1-12 - Rakesh V. Vohra:
Probabilistic analysis of the longest hamiltonian tour problem. 13-18 - Shuichi Ueno, Yoji Kajitani, Hajime Wada:
Minimum augmentation of a tree to a K-edge-connected graph. 19-25 - Ding-Zhu Du, Frank K. Hwang:
Generalized de Bruijn digraphs. 27-38 - Oded Berman, David Simchi-Levi, Arie Tamir:
The minimax multistop location problem on a tree. 39-49 - Themistocles Politof:
On a property of cyclic covers of p-graphs. 51-53 - J. Scott Provan:
Convexity and the Steiner tree problem. 55-72 - Masakazu Sengoku, Shoji Shinoda, Reigo Yatsuboshi:
On a function for the vulnerability of a directed flow network. 73-83
Volume 18, Number 2, Summer 1988
- Rajan Batta, Richard C. Larson, Amedeo R. Odoni:
A single-server priority queueing-location model. 87-103 - Takeo Yamada:
A network flow algorithm to find an elementary I/O matching. 105-109 - Vidyadhar G. Kulkarni:
Minimal spanning trees in undirected networks with exponentially distributed arc weights. 111-124 - Dana Richards, Arthur L. Liestman:
Generalizations of broadcasting and gossiping. 125-138 - Jane N. Hagstrom:
Computational complexity of PERT problems. 139-147
Volume 18, Number 3
- Fred Buckley, Lynne L. Doty, Frank Harary:
On graphs with signed inverses. 151-157 - N. Ravi, Richard E. Wendell:
The tolerance approach to sensitivity analysis in network linear programming. 159-171 - Robert C. Brigham, Phyllis Z. Chinn, Ronald D. Dutton:
Vertex domination-critical graphs. 173-179 - Wen Lea Pearn:
New lower bounds for the Capacitated Arc Routing Problem. 181-191 - Giovanni Andreatta, Luciano Romeo:
Stochastic shortest paths with recourse. 193-204 - Kazuo Iwano, Kenneth Steiglitz:
Planarity testing of doubly periodic infinite graphs. 205-222 - Hyeong-Ah Choi, S. Louis Hakimi:
Data transfers in networks with transceivers. 223-251
- R. Johnson, M. G. Pilcher:
The traveling salesman problem, edited by E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B Shmoys, John Wiley & Sons, Chichester, 1985, 463 pp. 253-254 - Jack Yurkiewicz, Pace Plaza:
Operations research: Applications and algorithms, by Wayne L. Winston, Duxbury press, Boston, 1987, 1025 pages. 254-256 - William F. Strain Jr.:
Linked local area networks, second edition by Alan J. Mayne, Wiley, 1986, 628 pp., price: $44.95. 256-257 - Paul A. Kaschube:
Combinatorics for computer science, by S. gill williamson, computer science press, Rockville, MD. 1985, 479 pp. price: $39.95. 258-259
Volume 18, Number 4, Winter 1988
- Udi Manber, Lawrence McVoy:
Efficient storage of nonadaptive routing tables. 263-272 - Ron S. Dembo, Ulrich Tulowitzki:
Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms. 273-284 - Awi Federgruen, Henry Groenevelt:
Polymatroidal flow network models with multiple sinks. 285-302 - Richard G. Ogier:
Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities. 303-318 - Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman:
A survey of gossiping and broadcasting in communication networks. 319-349
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 2024-11-25 22:44 CET 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:
