Searching for authors named "Daniele Frigioni" – sorted by Relevance.
-
Semi-dynamic Algorithms for Maintaining Single-Source Shortest Path Trees
- Semi-dynamic Algorithms for Maintaining Single-Source Shortest Path Trees Daniele Frigioni yz
- Cited by 16 (2 self) – Add To MetaCart
-
Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract)
- Fully Dynamic Output Bounded Single Source Shortest Path Problem Daniele Frigioni yz Alberto
- Cited by 20 (4 self) – Add To MetaCart
-
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
- Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, and Umberto Nanni Dipartimento di Informatica e
- Cited by 10 (2 self) – Add To MetaCart
-
Fully Dynamic Shortest Paths and Negative Cycle Detection on Digraphs with Arbitrary Arc Weights
- Daniele Frigioni yz Alberto Marchetti-Spaccamela z Umberto Nanni z Abstract We study the problem
- Cited by 14 (2 self) – Add To MetaCart
-
Exploration of Geographic Databases: Supporting a Focus+Context Interaction Style
- Cicerone, Daniele Frigioni, Laura Tarantino Dipartimento di Ingegneria Elettrica - Università degli Studi
- Cited by 1 (1 self) – Add To MetaCart
-
Dynamically Switching Vertices in Planar Graphs
- Dynamically Switching Vertices in Planar Graphs Daniele Frigioni y Giuseppe F. Italiano z
- Cited by 3 (0 self) – Add To MetaCart
-
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem
- Frigioni zx Mario Ioffreda x Umberto Nanni x Giulio Pasqualone x December 30, 1997 Abstract
- Cited by 14 (2 self) – Add To MetaCart
-
A Uniform Approach to Semi-Dynamic Problems on Digraphs
- A uniform approach to semi-dynamic problems on digraphs Serafino Cicerone y Daniele Frigioni
- Cited by 3 (1 self) – Add To MetaCart
-
Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae
- Giorgio Ausiello y Paolo Giulio Franciosa y Daniele Frigioni z Roberto Giaccio y Abstract
- Add To MetaCart
-
A Fully Dynamic Algorithm for Distributed Shortest Paths
- Daniele Frigioni y Umberto Nanni y Abstract We propose a fully-dynamic distributed algorithm
- Cited by 5 (2 self) – Add To MetaCart

