Daniele Frigioni

Prof. Daniele Frigioni

Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, 67100 L’Aquila, Italy
orcid

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2000 in Journal of Algorithms
Verified
Journal Article
Closed access
DFDaniele Frigioni
Daniele Frigioni
AMAlberto Marchetti-Spaccamela
Alberto Marchetti-Spaccamela
UNUmberto Nanni
Umberto Nanni

1 November 1998 in Algorithmica
Verified
Journal Article
Closed access
PDF file
DFDaniele Frigioni
Daniele Frigioni
ASAlberto Spaccamela
Alberto Spaccamela
UNUmberto Nanni
Umberto Nanni

16 October 2001
Verified
Book Chapter
Closed access
PDF file
GAGiorgio Ausiello
Giorgio Ausiello
PFPaolo G. Franciosa
Paolo G. Franciosa
DFDaniele Frigioni
Daniele Frigioni

1 September 2000 in Algorithmica
Verified
Journal Article
Closed access
PDF file
DFDaniele Frigioni
Daniele Frigioni
GIG. F. Italiano
G. F. Italiano

1 September 1998 in ACM Journal of Experimental Algorithmics
Verified
Journal Article
Open access
DFDaniele Frigioni
Daniele Frigioni
MIMario Ioffreda
Mario Ioffreda
UNUmberto Nanni
Umberto Nanni
GPGiulio Pasqualone
Giulio Pasqualone
In this paper we propose the first experimental study of the fully dynamic single-source shortest-paths problem on directed graphs with positive real edge weights. In particular, we perform an experimental analysis of three different algorithms: Dijkstra's algorithm, and the two output bounded algorithms proposed by Ramalingam and Reps in [30] and by Frigioni, Marchetti-Spaccamela and Nanni in [18], respectively. The main goal of this paper is to provide a first experimental evidence for: (a) the effectiveness of dynamic algorithms for shortest paths with respect to a traditional static approach to this problem; (b) the validity of the theoretical model of output boundedness to analyze dynamic graph algorithms. Beside random generated graphs, useful to capture the "asymptotic" behavior of the algorithms, we also developed experiments by considering a widely used graph from the real world, i.e., the Internet graph.

1 December 2018 in Information and Computation
Verified
Journal Article
Closed access
MDMattia D'Emidio
Mattia D'Emidio
GSGabriele Di Stefano
Gabriele Di Stefano
DFDaniele Frigioni
Daniele Frigioni
ANAlfredo Navarra
Alfredo Navarra