Sciweavers

88 search results - page 1 / 18
» A new approach to dynamic all pairs shortest paths
Sort
View
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
15 years 9 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
SODA
2004
ACM
76views Algorithms» more  SODA 2004»
14 years 11 months ago
Experimental analysis of dynamic all pairs shortest path algorithms
Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. I...
IJCV
2002
156views more  IJCV 2002»
14 years 9 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal