The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We study the fully-dynamic all pairs shortest path problem for graphs with arbitrary non-negative edge weights. It is known for digraphs that an update of the distance matrix costs $\ensuremath{{\cal \tilde O}}(n^{2.75})$ worst-case time [Thorup, STOC ’05] and $\ensuremath{{\cal \tilde O}}(n^2)$ amortized time [Demetrescu and Italiano, J.ACM ’04] where n is the number of vertices. We present...
We study the fully-dynamic all pairs shortest path problem for graphs with arbitrary non-negative edge weights. It is known for digraphs that an update of the distance matrix costs O(n2.75polylog(n)) worst-case time (Thorup, 2005 [20]) and O(n2log3(n)) amortized time (Demetrescu and Italiano, 2004 [4]) where n is the number of vertices. We present the first average-case analysis of the undirected...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.