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