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...

ver descrição completa

Detalhes 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
Formato: capítulo de livro
Estado:Versión publicada
Fecha de publicación:2011
País:España
Recursos:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/33827
Acesso em linha:http://hdl.handle.net/11441/33827
https://doi.org/10.1007/978-3-642-34191-5_16
Access Level:acceso abierto
Palavra-chave:graph drawing
grid locatable
grid embeddable
chromatic number
id ES_4c4e34a08da5cb40e24934af59cc8f9f
oai_identifier_str oai:idus.us.es:11441/33827
network_acronym_str ES
network_name_str España
repository_id_str
spelling Compact Grid Representation of GraphsCáceres González, JoséGrima Ruiz, Clara IsabelCortés Parejo, María del CarmenHachimori, MasahiroMárquez Pérez, AlbertoMukae, RaijiNakamoto, AtsuhiroNegami, SeiyaRobles Arias, RafaelValenzuela Muñoz, Jesúsgraph drawinggrid locatablegrid embeddablechromatic numberA 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.Matemática Aplicada I2011info:eu-repo/semantics/bookPartinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/11441/33827https://doi.org/10.1007/978-3-642-34191-5_16reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésComputational Geometry (2011), Lecture Notes in Computer Science, Vol. 7579, pp 166-174info:eu-repo/semantics/openAccessoai:idus.us.es:11441/338272026-06-17T12:51:07Z
dc.title.none.fl_str_mv Compact Grid Representation of Graphs
title Compact Grid Representation of Graphs
spellingShingle Compact Grid Representation of Graphs
Cáceres González, José
graph drawing
grid locatable
grid embeddable
chromatic number
title_short Compact Grid Representation of Graphs
title_full Compact Grid Representation of Graphs
title_fullStr Compact Grid Representation of Graphs
title_full_unstemmed Compact Grid Representation of Graphs
title_sort Compact Grid Representation of Graphs
dc.creator.none.fl_str_mv 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
author Cáceres González, José
author_facet 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
author_role author
author2 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
author2_role author
author
author
author
author
author
author
author
author
dc.contributor.none.fl_str_mv Matemática Aplicada I
dc.subject.none.fl_str_mv graph drawing
grid locatable
grid embeddable
chromatic number
topic graph drawing
grid locatable
grid embeddable
chromatic number
description 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.
publishDate 2011
dc.date.none.fl_str_mv 2011
dc.type.none.fl_str_mv info:eu-repo/semantics/bookPart
info:eu-repo/semantics/publishedVersion
format bookPart
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11441/33827
https://doi.org/10.1007/978-3-642-34191-5_16
url http://hdl.handle.net/11441/33827
https://doi.org/10.1007/978-3-642-34191-5_16
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Computational Geometry (2011), Lecture Notes in Computer Science, Vol. 7579, pp 166-174
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869407618948136960
score 15,300719

Registos relacionados