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: Author="Gavril, F."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Chordless paths, odd holes, and kernels in graphs without
m
-obstructions
F. Gavril
,
V. Toledano Laredo
,
D. de Werra
Journal of Algorithms
17
(2), 1994, pp. 207-221
Intersection graphs of concatenable subtrees of graphs
F. Gavril
,
J. Urrutia
Discrete Applied Mathematics
52
(2), 1994, pp. 195-209
An algorithm for fraternal orientation of graphs
J. Urrutia
,
F. Gavril
Information Processing Letters
41
, 1992, pp. 271-274
Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs
F. Gavril
,
J. Schönheim
Journal of Algorithms
6
(2), 1985, pp. 239-252
Testing for equality between maximum matching and minimum node covering
F. Gavril
Information Processing Letters
6
(6), 1976, December, pp. 199-202
Merging with parallel processors
F. Gavril
Communications of the ACM
18
(10), 1975, October, pp. 588-591