Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 28
Volume 28, Number 1, August 1996
- Oded Berman, Zvi Drezner, George O. Wesolowsky:
Minimum covering criterion for obnoxious facility location on a network. 1-5 - Qiao Li, Dominique Sotteau, Junming Xu:
2-diameter of de Bruijn graphs. 7-14 - Si-Qing Zheng:
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs. 15-19 - Geng Lin, Nicholas Pippenger:
Routing algorithms for switching networks with probabilistic traffic. 21-29 - Enrique F. Castillo, José Manuel Gutiérrez, Ali S. Hadi:
A new method for efficient symbolic propagation in discrete Bayesian networks. 31-43 - J. Ghoshal, Renu C. Laskar, Dan Pillone:
Minimal rankings. 45-53 - J. MacGregor Smith:
Topological network design of state-dependent queueing networks. 55-68
Volume 28, Number 2, September 1996
- Ram Swaminathan:
Divide-and-conquer algorithms for graph-layout problems. 69-85 - Keith E. Humenik, Peter Matthews, A. B. Stephens, Yelena Yesha:
Minimizing message complexity of partially replicated data on hypercubes. 87-95 - Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
On the connectivity and the conditional diameter of graphs and digraphs. 97-105 - Anna Nagurney, June Dong:
Network decomposition of general financial equilibria with transaction costs. 107-116 - Pierre Chardaire, Alain Sutter, Marie-Christine Costa:
Solving the dynamic facility location problem. 117-124
Volume 28, Number 3, October 1996
- Kenneth A. Berman:
Vulnerability of scheduled networks and a generalization of Menger's Theorem. 125-134 - James A. Knisely, Renu C. Laskar:
Cyclic gossiping times for some classes of graphs. 135-141 - Andrzej Pelc:
Fault-tolerant broadcasting and gossiping in communication networks. 143-156 - Mokhtar Aboelaze:
MLH: A hierarchical hypercube network. 157-165 - Tae Ung Kim, Timothy J. Lowe, Arie Tamir, James E. Ward:
On the location of a tree-shaped facility. 167-175
Volume 28, Number 4, December 1996
- Yannis Manoussakis, Zsolt Tuza:
Optimal routings in communication networks with linearly bounded forwarding index. 177-180 - Gary Chartrand, Michelle Schultz, Steven J. Winters:
On eccentric vertices in graphs. 181-186 - Lusheng Wang, Tao Jiang:
An approximation scheme for some Steiner tree problems in the plane. 187-193 - Yao-Min Chen, Galen H. Sasaki:
Routing in quasi torus networks. 195-209 - Bahman Kalantari, Gholamreza B. Khosrovshahi:
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP. 211-219 - Dorit S. Hochbaum, Anu Pathria:
The bottleneck graph partition problem. 221-225
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-07-20 21: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:
