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=52
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
W. Matthew Carlyle
,
Johannes O. Royset
,
R. Kevin Wood
Networks
52
(4), 2008, pp. 256-270
On persistent directed graphs
Jorgen Bang-Jensen
,
Tibor Jordán
Networks
52
(4), 2008, pp. 271-276
Multiratae nonblocking multicast
\log_2(N, m, p)
networks
Bey-Chi Lin
,
Chin-Tau Lea
Networks
52
(4), 2008, pp. 277-286
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
Julie Christophe
,
Sophie Dewez
,
Jean-Paul Doignon
,
Gilles Fasbender
,
Philippe Grégoire
,
David Huygens
,
Martine Labbé
,
Sourour Elloumi
,
Hadrien Mélot
,
Hande Yaman
Networks
52
(4), 2008, pp. 287-298
Lower bounds for two-period grooming via linear programming duality
Charles J. Colbourn
,
Gaetano Quattrocchi
,
Violet R. Syrotiuk
Networks
52
(4), 2008, pp. 299-306
Grooming for two-period optical networks
Charles J. Colbourn
,
Gaetano Quattrocchi
,
Violet R. Syrotiuk
Networks
52
(4), 2008, pp. 307-324
F-chord: Improved uniform routing on Chord
G. Cordasco
,
L. Gargano
,
A. Negro
,
V. Scarano
,
M. Hammar
Networks
52
(4), 2008, pp. 325-332
Seiten
<
1
2