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=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sequences of graphical invariants
Jerzy Topp
Networks
25
(1), 1995, pp. 1-5
Edge-tenacious networks
Barry L. Piazza
,
Fred S. Roberts
,
Sam K. Stueckle
Networks
25
(1), 1995, pp. 7-17
Multicommodity flows in simple multistage networks
E.S. Elmallah
,
J.C. Culberson
Networks
25
(1), 1995, pp. 19-30
Lower bounds for the length of test sequences using UIOs
Marion Rodrigues
,
Hasan Ural
Networks
25
(1), 1995, pp. 31-39
Vertex domination-critical graphs
Jason Fulman
,
Denis Hanson
,
Gary MacGillivray
Networks
25
(2), 1995, pp. 41-43
Sales-Delivery Man problems on treelike networks
Igor Averbakh
,
Oded Berman
Networks
25
(2), 1995, pp. 45-58
Simple heuristics for unit disk graphs
M.V. Marathe
,
H. Breu
,
H.B. Hunt III
,
S.S. Ravi
,
D.J. Rosenkrantz
Networks
25
(1), 1995, pp. 59-68
Thirty-five-point rectilinear Steiner minimal trees in a day
Jeffrey S. Salowe
,
David M. Warme
Networks
25
(2), 1995, pp. 69-87
A capacity scaling algorithm for the constrained maximum flow problem
Ravindra K. Ahuja
,
James B. Orlin
Networks
25
(2), 1995, pp. 89-98
Threshold reliability of networks with small failure sets
Michael O. Ball
,
Jane N. Hagstrom
,
J. Scott Provan
Networks
25
(3), 1995, pp. 101-115
Monte Carlo and Markov chain techniques for network reliability and sampling
Adam L. Buchsbaum
,
Milena Mihail
Networks
25
(3), 1995, pp. 117-130
On reliability evaluation of a capacitated-flow network in terms of minimal pathsets
Jsen-Shung Lin
,
Chin-Chia Jane
,
John Yuan
Networks
25
(3), 1995, pp. 131-138
A forbidden minor characterization and reliability of a class of partial 4-trees
Gerard T. Lingner
,
Themistocles Politof
,
A. Satyanarayana
Networks
25
(3), 1995, pp. 139-146
A survey of efficient reliability computation using disjoint products approach
Suresh Rai
,
Malathi Veeraraghavan
,
Kishor S. Trivedi
Networks
25
(3), 1995, pp. 147-163
Consecutive cuts and paths, and bounds on
k
-terminal reliability
Heidi J. Strayer
,
Charles J. Colbourn
Networks
25
(3), 1995, pp. 165-175
On truncated-Newton methods for solving the spatial price equilibrium problem
M. Florian
,
S.J. Thomas
,
R.V.M. Zahar
Networks
25
(4), 1995, pp. 177-182
Recognizing small subgraphs
Gopalakrishnan Sundaram
,
Steven S. Skiena
Networks
25
(4), 1995, pp. 183-191
Graphs with not too many spanning trees
Guoli Ding
Networks
25
(4), 1995, pp. 193-197
The prize collecting Traveling Salesman problem: II. Polyhedral results
Egon Balas
Networks
25
(4), 1995, pp. 199-216