scientific article; zbMATH DE number 3900809

MaRDI QIDQ3679232zbMATH OpenFDO

Authors Shimon Even, Hillel Gazit

Publication date 1985

zbMATH Keywords

algorithmsData structuresdistancesshortest paths

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• scientific article; zbMATH DE number 219245
• Dynamic algorithms for shortest paths in planar graphs
• Worst-case update times for fully-dynamic all-pairs shortest paths
• A new approach to dynamic all pairs shortest paths

Cited in

(27)

• Finding paths and deleting edges in directed acyclic graphs
• A special case the of dynamization problem for least cost paths
• On-line computation of minimal and maximal length paths
• Complexity models for incremental computation
• Dynamic expression trees
• NC algorithms for dynamically solving the all pairs shortest paths problem and related problems
• Semi-dynamic breadth-first search in digraphs
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Disk-based shortest path discovery using distance index over large dynamic graphs
• Reactive proximity data structures for graphs
• The all-pairs quickest path problem
• Anytime search in dynamic graphs
• Fully dynamic all pairs shortest paths with real edge weights
• Distance Queries in Large-Scale Fully Dynamic Complex Networks
• Algorithmic techniques for maintaining shortest routes in dynamic networks
• Dynamically maintaining shortest path trees under batches of updates
• A survey on combinatorial optimization in dynamic environments
• Average case analysis of fully dynamic reachability for directed graphs
• scientific article; zbMATH DE number 4049076 (Why is no real title available?)
• scientific article; zbMATH DE number 1305092 (Why is no real title available?)
• Semi-dynamic shortest paths and breadth-first search in digraphs
• A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
• Algorithm Theory - SWAT 2004
• Average case analysis of fully dynamic connectivity for directed graphs
• Dynamic algorithms for shortest paths in planar graphs
• Lifelong planning \(\text{A}^*\)
• Dynamic shortest paths and transitive closure: algorithmic techniques and data structures

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 Q3679232)