A Linear Time Algorithm for Drawing a Graph in 3 Pages within its Isotopy Class in 3-Space

dc.creator	Kurlin, Vitaliy	es
dc.date.accessioned	2015-07-02T10:14:23Z
dc.date.available	2015-07-02T10:14:23Z
dc.date.issued	2015	es
dc.identifier.issn	1885-4508	es
dc.identifier.uri	http://hdl.handle.net/11441/26550
dc.description.abstract	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.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Universidad de Sevilla	es
dc.relation.ispartof	Image-A : Applicable Mathematics in Image Engineering, 4 (7)	es
dc.rights	Atribución-NoComercial-SinDerivadas 4.0 España	es
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	es
dc.subject	Embedding	es
dc.subject	3-page book	es
dc.subject	Knot	es
dc.subject	Link	es
dc.subject	Spatial graph	es
dc.subject	Isotopy	es
dc.title	A Linear Time Algorithm for Drawing a Graph in 3 Pages within its Isotopy Class in 3-Space	es
dc.type	info:eu-repo/semantics/article	es
dc.type.version	info:eu-repo/semantics/publishedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
dc.relation.publisherversion	http://institucional.us.es/revistas/imagen_a/7/SYNASC2014-WORKSHOPS_submission_58.pdf	es
dc.identifier.idus	https://idus.us.es/xmlui/handle/11441/26550

Ficheros	Tamaño	Formato	Ver	Descripción
A Linear Time Algorithm for ...	1.424Mb	[PDF]	Ver/Abrir

Excepto si se señala otra cosa, la licencia del ítem se describe como: Atribución-NoComercial-SinDerivadas 4.0 España