Compact Grid Representation of Graphs

A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges to line segments that avoid grid points but the extremes. Additionally G is said to be properly embeddable in the grid if it is grid locatable and the segments representing edg...

Descripción completa

Detalles Bibliográficos
Autores: Cáceres González, José, Grima Ruiz, Clara Isabel, Cortés Parejo, María del Carmen, Hachimori, Masahiro, Márquez Pérez, Alberto, Mukae, Raiji, Nakamoto, Atsuhiro, Negami, Seiya, Robles Arias, Rafael, Valenzuela Muñoz, Jesús
Tipo de recurso: capítulo de libro
Estado:Versión publicada
Fecha de publicación:2011
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/33827
Acceso en línea:http://hdl.handle.net/11441/33827
https://doi.org/10.1007/978-3-642-34191-5_16
Access Level:acceso abierto
Palabra clave:graph drawing
grid locatable
grid embeddable
chromatic number
Descripción
Sumario:A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges to line segments that avoid grid points but the extremes. Additionally G is said to be properly embeddable in the grid if it is grid locatable and the segments representing edges do not cross each other. We study the area needed to obtain those representations for some graph families.

Similares en LA Referencia