Artículo
A Linear Time Algorithm for Drawing a Graph in 3 Pages within its Isotopy Class in 3-Space
Autor/es | Kurlin, Vitaliy |
Fecha de publicación | 2015 |
Fecha de depósito | 2015-07-02 |
Publicado en |
|
Resumen | We consider undirected graphs up to an ambient isotopy in 3-space. Such a graph can be represented by a plane diagram or a Gauss code. We recognize in linear time if a Gauss code represents an actual graph in 3-space. We ... We consider undirected graphs up to an ambient isotopy in 3-space. Such a graph can be represented by a plane diagram or a Gauss code. We recognize in linear time if a Gauss code represents an actual graph in 3-space. We also design a linear time algorithm for drawing a topological 3-page embedding of a graph isotopic to a given graph. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
A Linear Time Algorithm for ... | 1.424Mb | [PDF] | Ver/ | |