Publication:3679232
From MaRDI portal
zbMath0565.05052MaRDI QIDQ3679232
Publication date: 1985
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
Dynamic algorithms for shortest paths in planar graphs, Lifelong planning \(\text{A}^*\), Dynamic shortest paths and transitive closure: algorithmic techniques and data structures, 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, The all-pairs quickest path problem, Anytime search in dynamic graphs, Fully dynamic all pairs shortest paths with real edge weights, A survey on combinatorial optimization in dynamic environments, Average case analysis of fully dynamic reachability for directed graphs