Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 21
Volume 21, Number 1, January 1991
- Jean-Claude Bermond, Dvora Tzvieli:
Minimal diameter double-loop networks: Dense optimal families. 1-9 - K. B. Reid:
Centroids to centers in trees. 11-17 - Dan Gusfield:
Efficient algorithms for inferring evolutionary trees. 19-28 - Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai:
Shortest path algorithms using dynamic breadth-first search. 29-50 - Sunil Chopra, M. R. Rao:
On the multiway cut polyhedron. 51-89 - Janusz A. Brzozowski, T. Gahlinger, Farhad Mavaddat:
Consistency and satisfiability of waveform timing specifications. 91-107 - Anna Nagurney, Lan Zhao:
A network equilibrium formulation of market disequilibrium and variational inequalities. 109-132
Volume 21, Number 2, March 1991
- Hanif D. Sherali, Thomas P. Rizzo:
Unbalanced, capacitated p-median problems on a chain graph with a continuum of link demands. 133-163 - Michel L. Balinski, Jaime Gonzalez:
Maximum matchings in bipartite graphs via strong spanning trees. 165-179 - Francis T. Boesch, Xiaoming Li, Charles L. Suffel:
On the existence of uniformly optimally reliable networks. 181-194 - Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa:
Polynomial time algorithms on circular-arc overlap graphs. 195-203 - Neal E. Young
, Robert Endre Tarjan, James B. Orlin:
Faster parametric shortest path and minimum-balance algorithms. 205-221 - Margaret L. Brandeau, Samuel S. Chiu:
Parametric analysis of optimal facility locations. 223-243 - Ortrud R. Oellermann:
Conditional graph connectivity relative to hereditary properties. 245-255
Volume 21, Number 3, May 1991
- Yong-Mao Chen, Prakash Ramanan:
Euclidean shortest path in the presence of obstacles. 257-265 - Sang-Bang Choi, Arun K. Somani:
The generalized folding-cube network. 267-294 - Ariel Orda, Raphael Rom:
Minimum weight paths in time-dependent networks. 295-319 - Erick Mata-Montero:
Resilience of partial k-tree networks with edge and node failures. 321-344 - Michael O. Ball, J. Scott Provan, Douglas R. Shier:
Reliability covering problems. 345-357 - Ashok T. Amin, Kyle Siegrist, Peter J. Slater:
On the nonexistence of uniformly optimal graphs for pair-connected reliability. 359-368
- Gary Ulrich:
Simulation methodology for statisticians, operations analysts and engineers, Vol. I, by P. A. W. Lewis and E. J. Orav, Wadsworth, Belmont, CA, 1989, 416 pp. 369-370 - Stephen G. Strickland:
Stochastic modeling and the theory of queues, by R. W. WOE, Rentice Hall, Engle- wood Cliffs, NJ, 1989, 556 pp. 371
Volume 21, Number 4, July 1991
- Robert J. Dawson, Abdel Aziz Farrag:
Fault-tolerant extensions of star networks. 373-385 - Dvora Tzvieli:
Minimal diameter double-loop networks. I. Large infinite optimal families. 387-415 - Wendy J. Myrvold, Kim H. Cheung, Lavon B. Page, Jo Ellen Perry:
Uniformly-most reliable networks do not always exist. 417-419 - Robert C. Brigham, Ronald D. Dutton:
A compilation of relations between graph invariants - supplement I. 421-455 - Lih-Hsing Hsu, Shih-Yih Wang:
Maximum independent number for series-parallel networks. 457-468 - José A. Ventura:
Computational development of a lagrangian dual approach for quadratic networks. 469-485
Volume 21, Number 5, August 1991
- Jeffrey B. Sidney, Stuart J. Sidney, Art Warburton:
Average properties of two-dimensional partial orders. 487-503 - Dan Gusfield, Dalit Naor:
Efficient algorithms for generalized cut-trees. 505-520 - Thore Egeland, Arne Bang Huseby:
On dependence and reliability computations. 521-545 - Tetsuo Ichimori, Naoki Katoh:
A two-commodity sharing problem on networks. 547-563 - Yuping Qiu:
Solution properties of oligopolistic network equilibria. 565-580 - Jane N. Hagstrom:
Computing rooted communication reliability in an almost acyclic digraph. 581-593
Volume 21, Number 6, October 1991
- David Avis, Michel Deza:
The cut cone, L1 embeddability, complexity, and multicommodity flows. 595-617 - John M. Mulvey, Hercules Vladimirou:
Solving multistage stochastic networks: An application of scenario aggregation. 619-643 - Hiroshi Nagamochi, Toshihide Ibaraki:
Maximum flows in probabilistic networks. 645-666 - Agha Iqbal Ali, Chung-Hsing Huang:
Balanced spanning forests and trees. 667-687 - Do Ba Khang, Okitsugu Fujiwara:
Approximate solutions of capacitated fixed-charge minimum cost network flow problems. 689-704
Volume 21, Number 7, December 1991
- Chengen Yang, Dayong Jin:
A primal-dual algorithm for the minimum average weighted length circuit problem. 705-712 - Shiow C. Lin, Eva Ma:
Sensitivity analysis of 0-1 multiterminal network flows. 713-745 - Robert A. Russell, Dave Gribbin:
A multiphase approach to the period routing problem. 747-765 - Veena Adlakha, Barbara Gladysz, Jerzy Kamburowski:
Minimum flows in (s, t) planar networks. 767-773 - Christos Alexopoulos, George S. Fishman:
Characterizing stochastic flow networks using the monte carlo method. 775-798
a service of 
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-04-25 04:48 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:
