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=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Network transformation and bounding network reliability
Jason I. Brown
,
Charles J. Colbourn
,
John S. Devitt
Networks
23
(1), 1993, pp. 1-17
A catalog of Steiner tree formulations
Michel X. Goemans
,
Young-soo Myung
Networks
23
(1), 1993, pp. 19-28
Efficient parallel algorithms for bipartite permutation graphs
Lin Chen
,
Yaacov Yesha
Networks
23
(1), 1993, pp. 29-39
Canceling most helpful total cuts for minimum cost network flow
Thomas R. Ervolina
,
S. Thomas McCormick
Networks
23
(1), 1993, pp. 41-52
A two-stage network with dual partial concentrators
F.K. Hwang
,
G.W. Richards
Networks
23
(1), 1993, pp. 53-58
Doubly chordal graphs, Steiner trees, and connected domination
M. Moscarini
Networks
23
(1), 1993, pp. 59-69
Local broadcasting in a tree under minisum criterion
Jae-moon Koh
,
Dong-wan Tcha
Networks
23
(1), 1993, pp. 71-79
The Traveling Salesman problem with cumulative costs
Lucio Bianco
,
Aristide Mingozzi
,
Salvatore Ricciardelli
Networks
23
(2), 1993, pp. 81-91
Graph endpoint coloring and distributed processing
D. de Werra
,
P. Hell
,
T. Kameda
,
N. Katoh
,
Ph. Solot
,
M. Yamashita
Networks
23
(2), 1993, pp. 93-98
Sharp bounds on the order, size, and stability number of graphs
Pierre Hansen
,
Maolin Zheng
Networks
23
(2), 1993, pp. 99-102
Shortest paths, single origin-destination network design, and associated polyhedra
Thomas L. Magnanti
,
Prakash Mirchandani
Networks
23
(2), 1993, pp. 103-121
Grid spanners
Arthur L. Liestman
,
Thomas C. Shermer
Networks
23
(2), 1993, pp. 123-133
Edge fault tolerance in graphs
Frank Harary
,
John P. Hayes
Networks
23
(2), 1993, pp. 135-142
A polynomial time solvable concave network flow problem
G.M. Guisewite
,
P.M. Pardalos
Networks
23
(2), 1993, pp. 143-147
On the star-delta transformation in network reliability
Lorenzo Traldi
Networks
23
(3), 1993, pp. 151-157
Decomposition of bipartite graphs under degree constraints
H.J. Broersma
,
R.J. Faudree
,
J. van den Heuvel
,
H.J. Veldman
Networks
23
(3), 1993, pp. 159-164
Bounds for the general capacitated routing problem
Klaus Jansen
Networks
23
(3), 1993, pp. 165-173
Shortest paths in stochastic networks with
ARC
length having discrete distributions
Gehan A. Corea
,
Vidyadhar G. Kurlkarni
Networks
23
(3), 1993, pp. 175-183
On uniformly optimally reliable graphs for pair connected reliability with vertex failures
A.T. Amin
,
K.T. Siegrist
,
P.J. Slater
Networks
23
(3), 1993, pp. 185-193
Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs
Collette R. Coullard
,
Abdur Rais
,
Ronald L. Rardin
,
Donald K. Wagner
Networks
23
(3), 1993, pp. 195-206
An upper bound on the number of cliques in a graph
Martin Farber
,
Mihály Hujter
,
Zsolt Tuza
Networks
23
(3), 1993, pp. 207-210
Introduction
D. Frank Hsu
Networks
23
(4), 1993, pp. 211-213
Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
S.G. Akl
,
K. Qiu
,
I. Stojmenović
Networks
23
(4), 1993, pp. 215-225
On the adjacency properties of Paley graphs
W. Ananchuen
,
L. Caccetta
Networks
23
(4), 1993, pp. 227-236
Uniform
d
-emulations of rings, with an application to distributed virtual ring construction
Erwin M. Bakker
,
Jan van Leeuwen
Networks
23
(4), 1993, pp. 237-248
Seiten 1
2
3
>