Abstract
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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Cáceres, J., Cortés, C., Grima, C. I., Hachimori, M., Márquez, A., Mukae, R., … Valenzuela, J. (2012). Compact grid representation of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7579 LNCS, pp. 166–174). https://doi.org/10.1007/978-3-642-34191-5_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
