Show simple item record

Authordc.contributor.authorGrippo, Luciano N. 
Authordc.contributor.authorMatamala Vásquez, Martín 
Authordc.contributor.authorSafe, Martín D. 
Authordc.contributor.authorStein, Maya 
Admission datedc.date.accessioned2016-04-11T21:33:04Z
Available datedc.date.available2016-04-11T21:33:04Z
Publication datedc.date.issued2016
Cita de ítemdc.identifier.citationTheoretical Computer Science Volumen: 609 Páginas: 511-514 Subdivisión: 2, Jan 2016en_US
Identifierdc.identifier.otherDOI: 10.1016/j.tcs.2015.11.014
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/137710
General notedc.descriptionArtículo de publicación ISIen_US
Abstractdc.description.abstractA set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p >= 1, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial time.en_US
Patrocinadordc.description.sponsorshipCONICET (Argentina) CONICYT (Chile) UBACyT 20020100100980 20020130100808BA CONICET PIP 112-200901-00178 112-201201-00450CO ANPCyT (Argentina) PICT-2012-1324 FONDECYT 1140766 Fondo Basal PFB-03 Nucleo Milenio Information and Coordination in networks ICM/FIC P10-24Fen_US
Lenguagedc.language.isoenen_US
Publisherdc.publisherElsevieren_US
Type of licensedc.rightsAtribución-NoComercial-SinDerivadas 3.0 Chile*
Link to Licensedc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/*
Keywordsdc.subjectBipartite graphen_US
Keywordsdc.subjectConvex partitionen_US
Keywordsdc.subjectGraph convexityen_US
Keywordsdc.subjectGeodesic convexityen_US
Títulodc.titleConvex p-partitions of bipartite graphsen_US
Document typedc.typeArtículo de revista


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record

Atribución-NoComercial-SinDerivadas 3.0 Chile
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 Chile