scientific article; zbMATH DE number 3907787
From MaRDI portal
Publication:3685214
Recommendations
- A special case the of dynamization problem for least cost paths
- NC algorithms for dynamically solving the all pairs shortest paths problem and related problems
- Incremental algorithms for minimal length paths
- Dynamic algorithms for shortest paths in planar graphs
- On-line and dynamic algorithms for shortest path problems
Cited in
(25)- Amortized efficiency of a path retrieval data structure
- 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
- Dynamic expression trees
- NC algorithms for dynamically solving the all pairs shortest paths problem and related problems
- On the computational complexity of dynamic graph problems
- Semi-dynamic breadth-first search in digraphs
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Heuristics for finding \(k\)-clubs in an undirected graph
- Disk-based shortest path discovery using distance index over large dynamic graphs
- The all-pairs quickest path problem
- Anytime search in dynamic graphs
- Algorithmic techniques for maintaining shortest routes in dynamic networks
- A survey on combinatorial optimization in dynamic environments
- Average case analysis of fully dynamic reachability for directed graphs
- Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
- Semi-dynamic shortest paths and breadth-first search in digraphs
- Sparse weight tolerant subgraph for single source shortest path
- Maintenance of triconnected components of graphs
- Average case analysis of fully dynamic connectivity for directed graphs
- Dynamic algorithms for shortest paths in planar graphs
- Maintenance of 2- and 3-edge-connected components of graphs. I
- 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 Q3685214)
