Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Networks AND Volume=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimum covering criterion for obnoxious facility location on a network
Oded Berman
,
Zvi Drezner
,
George O. Wesolowsky
Networks
28
(1), 1996, pp. 1-5
2-diameter of de Bruijn graphs
Qiao Li
,
Dominique Sotteau
,
Junming Xu
Networks
28
(1), 1996, pp. 7-14
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
S.Q. Zheng
Networks
28
(1), 1996, pp. 15-19
Routing algorithms for switching networks with probabilistic traffic
Geng Lin
,
Nicholas Pippenger
Networks
28
(1), 1996, pp. 21-29
A new method for efficient symbolic propagation in discrete Bayesian networks
Enrique Castillo
,
José Manuel Gutiérrez
,
Ali S. Hadi
Networks
28
(1), 1996, pp. 31-43
Minimal rankings
J. Ghoshal
,
R. Laskar
,
D. Pillone
Networks
28
(1), 1996, pp. 45-53
Topological network design of state-dependent queueing networks
J. MacGregor Smith
Networks
28
(1), 1996, pp. 55-68
Divide-and-conquer algorithms for graph-layout problems
Ram Swaminathan
Networks
28
(2), 1996, pp. 69-85
Minimizing message complexity of partially replicated data on hypercubes
Keith Humenik
,
Peter Matthews
,
A.B. Stephens
,
Yelena Yesha
Networks
28
(2), 1996, pp. 87-95
On the connectivity and the conditional diameter of graphs and digraphs
C. Balbuena
,
A. Carmona
,
J. Fàbrega
,
M.A. Fiol
Networks
28
(2), 1996, pp. 97-105
Network decomposition of general financial equilibria with transaction costs
Anna Nagurney
,
June Dong
Networks
28
(2), 1996, pp. 107-116
Solving the dynamic facility location problem
Pierre Chardaire
,
Alain Sutter
,
Marie-Christine Costa
Networks
28
(2), 1996, pp. 117-124
Vulnerability of scheduled networks and a generalized of Menger's theorem
Kenneth A. Berman
Networks
28
(3), 1996, pp. 125-134
Cyclic gossiping times for some classes of graphs
James A. Knisely
,
Renu Laskar
Networks
28
(3), 1996, pp. 135-141
Fault-tolerant broadcasting and gossiping in communication networks
Andrzej Pelc
Networks
28
(3), 1996, pp. 143-156
MLH: A hierarchical hypercube network
Mokhtar A. Aboelaze
Networks
28
(3), 1996, pp. 157-165
On the location of a tree-shaped facility
Tae Ung Kim
,
Timothy J. Lowe
,
Arie Tamir
,
James E. Ward
Networks
28
(3), 1996, pp. 167-175
Optimal routings in communication networks with linearly bounded forwarding index
Yannis Manoussakis
,
Zsolt Tuza
Networks
28
(4), 1996, pp. 177-180
On eccentric vertices in graphs
Gary Chartrand
,
Michelle Schultz
,
Steven J. Winters
Networks
28
(4), 1996, pp. 181-186
An approximation scheme for some Steiner tree problems in the plane
Lusheng Wang
,
Tao Jiang
Networks
28
(4), 1996, pp. 187-193
Routing in quasi torus networks
Yao-Min Chen
,
Galen H. Sasaki
Networks
28
(4), 1996, pp. 195-209
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP
B. Kalantari
,
G.B. Khosrovshahi
Networks
28
(4), 1996, pp. 211-219
The bottleneck graph partition problem
Dorit S. Hochbaum
,
Anu Pathria
Networks
28
(4), 1996, pp. 221-225