scientific article
From MaRDI portal
Publication:4036575
zbMath0764.68113MaRDI QIDQ4036575
Hristo N. Djidjev, Christos D. Zaroliagis, Grammati E. Pantziou
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items
Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems ⋮ A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs ⋮ Searching among intervals and compact routing tables ⋮ Searching among intervals and compact routing tables ⋮ Shortest beer path queries in outerplanar graphs ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Efficient parallel algorithms for shortest paths in planar digraphs ⋮ Planar graphs, negative weight edges, shortest paths, and near linear time ⋮ Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
