scientific article; zbMATH DE number 3900809
From MaRDI portal
Publication:3679232
zbMATH Open0565.05052MaRDI QIDQ3679232FDOQ3679232
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cited In (24)
- 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
- Algorithm Theory - SWAT 2004
- Complexity models for incremental computation
- Semi-dynamic breadth-first search in digraphs
- Lifelong planning \(\text{A}^*\)
- A survey on combinatorial optimization in dynamic environments
- 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
- Dynamic expression trees
- Title not available (Why is that?)
- The all-pairs quickest path problem
- Distance Queries in Large-Scale Fully Dynamic Complex Networks
- Algorithmic techniques for maintaining shortest routes in dynamic networks
- Average case analysis of fully dynamic connectivity for directed graphs
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)
