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: Author="Provan, J.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A paradigm for listing
(s,t)
-cuts in graphs
J.S. Provan
,
D.R. Shier
Algorithmica
15
, 1996, pp. 351-372
Reliability covering problems
M.O. Ball
,
J.S. Provan
,
D.R. Shier
Networks
21
(3), 1991, pp. 345-357
The complexity of reliability computations in planar and acyclic graphs
J.S. Provan
SIAM Journal on Computing
15
(3), 1986, August, pp. 694-702
The complexity of counting cuts and of computing the probability that a graph is connected
J.S. Provan
,
M.O. Ball
SIAM Journal on Computing
12
(4), 1983, November, pp. 777-788
Determinacy in linear systems and networks
J.S. Provan
SIAM Journal on Algebraic Discrete Methods
4
(2), 1983, June, pp. 262-278