scientific article; zbMATH DE number 5506235
From MaRDI portal
Publication:3601569
zbMATH Open1153.57304MaRDI QIDQ3601569FDOQ3601569
Authors: Martin Kuetz 
Publication date: 10 February 2009
Title of this publication is not available (Why is that?)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General low-dimensional topology (57M99)
Cited In (13)
- Toroidal grid minors and stretch in embedded graphs
- Towards geodesic ridge curve for region-wise linear representation of geodesic distance field
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- Topologically trivial closed walks in directed surface graphs
- Algorithms for the edge-width of an embedded graph
- Many distances in planar graphs
- Approximating the Crossing Number of Toroidal Graphs
- Computing the shortest essential cycle
- Counting and sampling minimum cuts in genus \(g\) graphs
- Splitting (complicated) surfaces is hard
- Title not available (Why is that?)
- Minimum Cuts in Surface Graphs
- Global minimum cuts in surface embedded graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601569)
