scientific article; zbMATH DE number 6783396
From MaRDI portal
Publication:5365044
zbMath1376.68107MaRDI QIDQ5365044
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133061
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) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (9)
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time ⋮ Computing the Fréchet Distance Between Polygons with Holes ⋮ Irrelevant vertices for the planar disjoint paths problem ⋮ Multicuts in planar and bounded-genus graphs with bounded number of terminals ⋮ Non-crossing shortest paths lengths in planar graphs in linear time ⋮ Non-crossing shortest paths lengths in planar graphs in linear time ⋮ Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ Non-crossing shortest paths in undirected unweighted planar graphs in linear time ⋮ Thick non-crossing paths in a polygonal domain
This page was built for publication:
