Volume 33; Issue 3

Networks

Volume 33; Issue 3
1

On diameter of permutation graphs

Gu, Weizhen
Journal:
Networks
Year:
1999
Language:
english
File:
PDF, 109 KB
english, 1999
3

Pseudo-Gilbert-Steiner trees

Trietsch, D., Weng, J. F.
Journal:
Networks
Year:
1999
Language:
english
File:
PDF, 69 KB
english, 1999
4

All-to-all communication for some wavelength-routed all-optical networks

Beauquier, Bruno
Journal:
Networks
Year:
1999
Language:
english
File:
PDF, 166 KB
english, 1999
5

A note on the bottleneck graph partition problem

Klinz, Bettina, Woeginger, Gerhard J.
Journal:
Networks
Year:
1999
Language:
english
File:
PDF, 47 KB
english, 1999
6

An expert system for coherent assessment of probabilities in multigraph models

Castillo, E., Hadi, A. S., Jubete, F., Solares, C.
Journal:
Networks
Year:
1999
Language:
english
File:
PDF, 231 KB
english, 1999
7

The probabilistic longest path problem

Murat, C�cile, Paschos, Vangelis Th.
Journal:
Networks
Year:
1999
Language:
english
File:
PDF, 141 KB
english, 1999
9

Various results on the toughness of graphs

Broersma, Hajo, Engbers, Erik, Trommel, Huib
Journal:
Networks
Year:
1999
Language:
english
File:
PDF, 90 KB
english, 1999
10

Multidimensional assortment problem with an application

Tripathy, Ashish, S�ral, Haldun, Gerchak, Yigal
Journal:
Networks
Year:
1999
Language:
english
File:
PDF, 107 KB
english, 1999