Mostra el registre d'ítem simple
Universal point subsets for planar graphs
dc.contributor.author | Angelini, Patrizio |
dc.contributor.author | Binucci, Carla |
dc.contributor.author | Evans, William |
dc.contributor.author | Hurtado Díaz, Fernando Alfredo |
dc.contributor.author | Liotta, Giuseppe |
dc.contributor.author | Mchedlidze, Tamara |
dc.contributor.author | Meijer, Henk |
dc.contributor.author | Okamoto, Yoshio |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II |
dc.date.accessioned | 2013-03-05T17:31:44Z |
dc.date.available | 2013-03-05T17:31:44Z |
dc.date.created | 2012 |
dc.date.issued | 2012 |
dc.identifier.citation | Angelini, P. [et al.]. Universal point subsets for planar graphs. A: International Symposium on Algorithms and Computation. "Lecture Notes in Computer Science". Taipei: Springer, 2012, p. 423-432. |
dc.identifier.isbn | 978-3-642-35261-4 |
dc.identifier.uri | http://hdl.handle.net/2117/18077 |
dc.description.abstract | A set S of k points in the plane is a universal point subset for a class G of planar graphs if every graph belonging to G admits a planar straight-line drawing such that k of its vertices are represented by the points of S . In this paper we study the following main problem: For a given class of graphs, what is the maximum k such that there exists a universal point subset of size k ? We provide a ⌈ √ n ⌉ lower bound on k for the class of planar graphs with n ver- tices. In addition, we consider the value F ( n; G ) such that every set of F ( n; G ) points in general position is a universal subset for all graphs with n vertices be- longing to the family G , and we establish upper and lower bounds for F ( n; G ) for different families of planar graphs, including 4-connected planar graphs and nested-triangles graphs. |
dc.format.extent | 10 p. |
dc.language.iso | eng |
dc.publisher | Springer |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria convexa i discreta |
dc.subject.lcsh | Discrete geometry |
dc.title | Universal point subsets for planar graphs |
dc.type | Conference report |
dc.subject.lemac | Geometria discreta |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.identifier.doi | 10.1007/978-3-642-35261-4_45 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::52 Convex and discrete geometry::52C Discrete geometry |
dc.relation.publisherversion | http://link.springer.com/chapter/10.1007/978-3-642-35261-4_45 |
dc.rights.access | Open Access |
local.identifier.drac | 11215444 |
dc.description.version | Postprint (author’s final draft) |
local.citation.author | Angelini, P.; Binucci, C.; Evans, W.; Hurtado, F.; Liotta, G.; Mchedlidze, T.; Meijer, H.; Okamoto, Y. |
local.citation.contributor | International Symposium on Algorithms and Computation |
local.citation.pubplace | Taipei |
local.citation.publicationName | Lecture Notes in Computer Science |
local.citation.startingPage | 423 |
local.citation.endingPage | 432 |