#### Filter Results:

- Full text PDF available (22)

#### Publication Year

1988

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
- Inf. Process. Lett.
- 1996

A cop&g&z! order of the vertices of a directed acyclic graph G = (y E) is any total order ord such that if (x, y) f E, then x precedes y in ord. In this paper we consider the dynamic version of thisâ€¦ (More)

1 Introduction

- Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
- J. Algorithms
- 2000

We propose fully dynamic algorithms for maintaining the distances and the shortest paths from a single source in either a directed or an undirected graph with positive real edge weights, handlingâ€¦ (More)

- Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasquale
- ACM Journal of Experimental Algorithmics
- 1998

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â€¦ (More)

Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation INMOS Transputer Router chip.â€¦ (More)

- Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni
- Inf. Process. Lett.
- 1997

We propose an incremental algorithm to maintain a DFS-forest in a directed acyclic graph under a sequence of arc insertions in 0( nm) worst case total time, where n is the number of nodes and m isâ€¦ (More)

We study the problem of maintaining the distances and the shortest paths from a source node in a directed graph with arbitrary arc weights, when weight updates of arcs are performed. We proposeâ€¦ (More)

We propose a fully-dynamic distributed algorithm for the all-pairs shortest paths problem on general networks with positive real edge weights. If âˆ†Ïƒ is the number of pairs of nodes changing theâ€¦ (More)

Abs t rac t . Directed hypergraphs are used in several applications to model different combinatorial structures. A directed hypergraph is defined by a set of nodes and a set of hyperarcs, eachâ€¦ (More)

- Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis
- ACM Journal of Experimental Algorithmics
- 2001

We perform an extensive experimental study of several dynamic algorithms for transitive closure. In particular, we implemented algorithms given by Italiano, Yellin, Cicerone et al., and two recentâ€¦ (More)