The following pages link to Umberto Nanni (Q286983):
Displayed 29 items.
- Item:Q286983 (redirect page) (← links)
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs (Q286984) (← links)
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- The weighted list update problem and the lazy adversary (Q1208728) (← links)
- Semidynamic algorithms for maintaining single-source shortest path trees (Q1273931) (← links)
- A uniform approach to semi-dynamic problems on digraphs (Q1274321) (← links)
- Multidimensional interval routing schemes (Q1275073) (← links)
- A fully dynamic algorithm for distributed shortest paths. (Q1401293) (← links)
- Maintaining a topological order under edge insertions (Q1847369) (← links)
- Characterization results of all shortest paths interval routing schemes (Q2744657) (← links)
- (Q3138872) (← links)
- Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs (Q3167606) (← links)
- Incremental algorithms for minimal length paths (Q3988824) (← links)
- (Q4028899) (← links)
- (Q4037423) (← links)
- (Q4218092) (← links)
- (Q4252034) (← links)
- (Q4470497) (← links)
- (Q4508381) (← links)
- Fully dynamic shortest paths in digraphs with arbitrary arc weights (Q4820906) (← links)
- (Q4875188) (← links)
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees (Q4943078) (← links)
- An Experimental Study of Dynamic Algorithms for Transitive Closure (Q5269373) (← links)
- Power balance and apportionment algorithms for the United States Congress (Q5463379) (← links)
- Dynamic algorithms for classes of constraint satisfaction problems (Q5941281) (← links)
- Multi-dimensional Interval Routing Schemes (Q6084552) (← links)
- On-line graph algorithms for incremental compilation (Q6184394) (← links)