scientific article; zbMATH DE number 2079363

MaRDI QIDQ4471322zbMATH OpenFDO

Authors Surender Baswana, Ramesh Hariharan, Sandeep Sen

Publication date 28 July 2004

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

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)