scientific article
From MaRDI portal
Publication:3685214
zbMath0568.68050MaRDI QIDQ3685214
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items
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, On the computational complexity of dynamic graph problems, Amortized efficiency of a path retrieval data structure, Dynamic shortest paths and transitive closure: algorithmic techniques and data structures, Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions, 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, Heuristics for finding \(k\)-clubs in an undirected graph, On-line computation of minimal and maximal length paths, Dynamic algorithms for shortest paths in planar graphs, Maintenance of 2- and 3-edge-connected components of graphs. I, Maintenance of triconnected components of graphs, Disk-based shortest path discovery using distance index over large dynamic graphs, Sparse Weight Tolerant Subgraph for Single Source Shortest Path, 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, An exact algorithm for the maximum \(k\)-club problem in an undirected graph, Lifelong planning \(\text{A}^*\)
