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=35
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem
Luis Gouveia
,
Pedro Martins
Networks
35
(1), 2000, pp. 1-16
The single allocation problem in the interacting three-hub network
Jinhyeon Sohn
,
Sungsoo Park
Networks
35
(1), 2000, pp. 17-25
Degree-preserving trees
Hajo Broersma
,
Otto Koppius
,
Hilde Tuinstra
,
Andreas Huck
,
Ton Kloks
,
Dieter Kratsch
,
Haiko Müller
Networks
35
(1), 2000, pp. 26-39
Source-limited inclusive routing: A new paradigm for multicast communication
Barbara D. Gannod
,
Abdol H. Esfahanian
,
Eric Torng
Networks
35
(1), 2000, pp. 40-55
Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
Gen-Huey Chen
,
Jung-Sheng Fu
,
Jywe-Fei Fang
Networks
35
(1), 2000, pp. 56-69
A general framework for functional networks
Enrique Castillo
,
Angel Cobo
,
Ruslán Gómez-Nesterkin
,
Ali S. Hadi
Networks
35
(1), 2000, pp. 70-82
Cluster fault-tolerant routing in star graphs
Qian-Ping Gu
,
Shietung Peng
Networks
35
(1), 2000, pp. 83-90
A truncated primal-infeasible dual-feasible network interior point method
L.F. Portugal
,
M.G.C. Resende
,
G. Veiga
,
J.J. Júdice
Networks
35
(2), 2000, pp. 91-108
Network reliability with node failures
Shaobin Liu
,
Kam-Hoi Cheng
,
Xiaoping Liu
Networks
35
(2), 2000, pp. 109-117
State space partition algorithms for stochastic systems with applications to minimum spanning trees
Christos Alexopoulos
,
Jay A. Jacobson
Networks
35
(2), 2000, pp. 118-138
Orienting split-stars and alternating group graphs
Eddie Cheng
,
Marc J. Lipman
Networks
35
(2), 2000, pp. 139-144
On the performance and feasibility of multicast core selection heuristics
Eric Fleury
,
Yih Huang
,
Philip K. McKinley
Networks
35
(2), 2000, pp. 145-156
Optimal fault-tolerant networks with a server
S.A. Choudum
,
S. Sivagurunathan
Networks
35
(2), 2000, pp. 157-160
Cycles in butterfly graphs
Shien-Ching Hwang
,
Gen-Huey Chen
Networks
35
(2), 2000, pp. 161-171
Clustering for faster network simplex pivots
David Eppstein
Networks
35
(3), 2000, pp. 173-180
Robust path choice in networks with failures
Michael C. Ferris
,
Andrzej Ruszczyński
Networks
35
(3), 2000, pp. 181-194
The searchlight guarding problem on weighted split graphs and weighted cographs
William C.K. Yen
,
C.Y. Tang
Networks
35
(3), 2000, pp. 195-206
Shortest path routing and fault-tolerant routing on de Bruijn Networks
Jyh-Wen Mao
,
Chang-Biau Yang
Networks
35
(3), 2000, pp. 207-215
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
Dukwon Kim
,
Panos M. Pardalos
Networks
35
(3), 2000, pp. 216-222
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
Youngho Lee
,
Hanif D. Sherali
,
Junghee Han
,
Seong-in Kim
Networks
35
(3), 2000, pp. 223-232
Construction schemes for fault-tolerant Hamiltonian graphs
Jeng-Jung Wang
,
Chun-Nan Hung
,
Jimmy J.M. Tan
,
Liy-Hsing Hsu
,
Ting-Yi Sung
Networks
35
(3), 2000, pp. 233-245
Wavelength allocation on trees of rings
Xiaotie Deng
,
Guojun Li
,
Wenan Zang
Networks
35
(4), 2000, pp. 248-252
Improvement on vertex cover for low-degree graphs
Jianer Chen
,
Lihua Liu
,
Weijia Jia
Networks
35
(4), 2000, pp. 253-259
Minimizing number of wavelengths in multicast routing trees in WDM networks
Deying Li
,
Xiufeng Du
,
Xiaodong Hu
,
Lu Ruan
,
Xiaohua Jia
Networks
35
(4), 2000, pp. 260-265
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
Toshio Nakata
,
Hiroshi Imahayashi
,
Masafumi Yamashita
Networks
35
(4), 2000, pp. 266-273
Seiten 1
2
>