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=Algorithmica AND Volume=7
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
Richard B. Borie
,
R. Gary Parker
,
Craig A. Tovey
Algorithmica
7
, 1992, pp. 555-581
A linear-time algorithm for finding a sparse
k
-connected spanning subgraph of a
k
-connected graph
Hiroshi Nagamochi
,
Toshihide Ibaraki
Algorithmica
7
, 1992, pp. 583-596
Expected parallel time and sequential space complexity of graph and digraph problems
John Reif
,
Paul Spirakis
Algorithmica
7
, 1992, pp. 597-630
Efficient parallel algorithms for path problems in directed graphs
Joan M. Lucas
,
Marian Gunsher Sackrowitz
Algorithmica
7
, 1992, pp. 631-648
Seiten
<
1
2