scientific article; zbMATH DE number 2079363
From MaRDI portal
Publication:4471322
zbMATH Open1094.68603MaRDI QIDQ4471322FDOQ4471322
Authors: Surender Baswana, Ramesh Hariharan, Sandeep Sen 
Publication date: 28 July 2004
Title of this publication is not available (Why is that?)
Recommendations
- Maintaining shortest paths under deletions in weighted directed graphs
- Maintaining shortest paths under deletions in weighted directed graphs
- Dynamic approximate all-pairs shortest paths in undirected graphs
- Improved dynamic algorithms for maintaining approximate shortest paths under deletions
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
Cited In (5)
- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs
- Maintaining shortest paths under deletions in weighted directed graphs
- On dynamic shortest paths problems
- Maintaining shortest paths under deletions in weighted directed graphs
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471322)
