|
Journals in DBLP
Networks 1996, volume: 28, number: 1
- Oded Berman, Zvi Drezner, George O. Wesolowsky
Minimum covering criterion for obnoxious facility location on a network. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:28, n:1, pp:1-5 [Journal]
- Qiao Li, Dominique Sotteau, Junming Xu
2-diameter of de Bruijn graphs. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:28, n:1, pp:7-14 [Journal]
- Si-Qing Zheng
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:28, n:1, pp:15-19 [Journal]
- Geng Lin, Nicholas Pippenger
Routing algorithms for switching networks with probabilistic traffic. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:28, n:1, pp:21-29 [Journal]
- Enrique Castillo, José Manuel Gutiérrez, Ali S. Hadi
A new method for efficient symbolic propagation in discrete Bayesian networks. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:28, n:1, pp:31-43 [Journal]
- J. Ghoshal, Renu Laskar, D. Pillone
Minimal rankings. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:28, n:1, pp:45-53 [Journal]
- J. MacGregor Smith
Topological network design of state-dependent queueing networks. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:28, n:1, pp:55-68 [Journal]
|