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
[1]
Hilfe
Suche: Journal=Networks AND Volume=53
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cost minimization in wireless networks with a bounded and unbounded number of interfaces
Ralf Klasing
,
Adrian Kosowski
,
Alfredo Navarra
Networks
53
(3), 2009, pp. 266-275
Minimizing SONET Add-Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths
Yong Wang
,
Qian-Ping Gu
Networks
53
(3), 2009, pp. 276-286
A linear algorithm for finding the
k
-broadcast center of a tree
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
,
Bin Shao
Networks
53
(3), 2009, pp. 287-292
Matchings in connection with ground delay program planning
Michael Ball
,
Geir Dahl
,
Thomas Vossen
Networks
53
(3), 2009, pp. 293-306
Edge-fault-tolerant pancyclicity of alternating group graphs
Ping-Ying Tsai
,
Gen-Huey Chen
,
Jung-Sheng Fu
Networks
53
(3), 2009, pp. 307-313
New largest known graphs of diameter 6
Guillermo Pineda-Villavicencio
,
José Gómez
,
Mirka Miller
,
Hebert Pérez-Rosés
Networks
53
(4), 2009, pp. 315-328
The forwarding indices of wrapped butterfly networks
Xinmin Hou
,
Jun-Ming Xu
,
Min Xu
Networks
53
(4), 2009, pp. 329-333
Lower bounding techniques for the degree-constrained network design problem
Güvenç Şahin
,
Ravindra K. Ahuja
Networks
53
(4), 2009, pp. 334-344
Approximating the smallest
k
-edge connected spanning subgraph by LP-rounding
Harold N. Gabow
,
Michel X. Goemans
,
Éva Tardos
,
David P. Williamson
Networks
53
(4), 2009, pp. 345-357
Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
Ranga Muhandiramge
,
Natashia Boland
Networks
53
(4), 2009, pp. 358-381
Cost-effective designs of fault-tolerant access networks in communication systems
Xujin Chen
,
Bo Chen
Networks
53
(4), 2009, pp. 382-391
Searching symmetric networks with Utilitarian-Postman paths
Steve Alpern
,
Vic Baston
,
Shmuel Gal
Networks
53
(4), 2009, pp. 392-402
Seiten
<
1
2