Publication:4607913
From MaRDI portal
zbMath1403.68172arXiv1512.02068MaRDI QIDQ4607913
Oren Weimann, Kirill Nikolaev, Yahav Nussbaum, Shay Mozes
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1512.02068
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Faster shortest paths in dense distance graphs, with applications, A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization, Topologically trivial closed walks in directed surface graphs, Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths