scientific article
From MaRDI portal
Publication:3601569
zbMath1153.57304MaRDI QIDQ3601569
Publication date: 10 February 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
General low-dimensional topology (57M99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (14)
Minimum Cuts in Surface Graphs ⋮ Schnyder woods for higher genus triangulated surfaces, with applications to encoding ⋮ Computing the shortest essential cycle ⋮ Multicuts in planar and bounded-genus graphs with bounded number of terminals ⋮ Algorithms for the edge-width of an embedded graph ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Topologically trivial closed walks in directed surface graphs ⋮ Approximating the Crossing Number of Toroidal Graphs ⋮ Splitting (complicated) surfaces is hard ⋮ Unnamed Item ⋮ Toroidal grid minors and stretch in embedded graphs ⋮ Many distances in planar graphs ⋮ Unnamed Item ⋮ Discrete systolic inequalities and decompositions of triangulated surfaces
This page was built for publication:
