The Complexity of Computing the Cylindrical and the t-Circle Crossing Number of a Graph

A plane drawing of a graph is cylindrical if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoints) any of these circles. The cylindrical crossing number of a graph G is the minimum number of crossings in a cylindrical draw...

Full description

Autores:

Duque Patiño, Frank Rodrigo
González Aguilar, Hernán
Hernández Vélez, César
Leaños, Jesús
Medina, Carolina

Tipo de recurso:

Article of investigation

Fecha de publicación:

2018

Institución:

Universidad de Antioquia

Repositorio:

Repositorio UdeA

Idioma:

eng

OAI Identifier:

oai:bibliotecadigital.udea.edu.co:10495/46331

Acceso en línea:

https://hdl.handle.net/10495/46331

Palabra clave:

Álgebras cilíndricas
Cylindric algebras
Teoría de grafos
Graph theory
Cruce cilíndrico
Cylindrical crossing
http://id.loc.gov/authorities/subjects/sh85035133

Rights

openAccess

License

http://creativecommons.org/licenses/by-nd/4.0/