scientific article
From MaRDI portal
Publication:3679232
zbMath0565.05052MaRDI QIDQ3679232
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (20)
Complexity models for incremental computation ⋮ The all-pairs quickest path problem ⋮ Semi-dynamic shortest paths and breadth-first search in digraphs ⋮ Dynamic expression trees ⋮ A survey on combinatorial optimization in dynamic environments ⋮ NC algorithms for dynamically solving the all pairs shortest paths problem and related problems ⋮ A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs ⋮ Dynamic shortest paths and transitive closure: algorithmic techniques and data structures ⋮ Anytime search in dynamic graphs ⋮ Finding paths and deleting edges in directed acyclic graphs ⋮ Average case analysis of fully dynamic connectivity for directed graphs ⋮ A special case the of dynamization problem for least cost paths ⋮ On-line computation of minimal and maximal length paths ⋮ Dynamic algorithms for shortest paths in planar graphs ⋮ Fully dynamic all pairs shortest paths with real edge weights ⋮ Disk-based shortest path discovery using distance index over large dynamic graphs ⋮ Average case analysis of fully dynamic reachability for directed graphs ⋮ Semi-dynamic breadth-first search in digraphs ⋮ Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks ⋮ Lifelong planning \(\text{A}^*\)
This page was built for publication:
