Convex p-partitions of bipartite graphs

Show simple item record

dc.creator Grippo, Luciano Norberto
dc.creator Mataala, Martín
dc.creator Safe, Martín D.
dc.creator Stein, Maya J.
dc.date.accessioned 2024-07-16T17:07:05Z
dc.date.available 2024-07-16T17:07:05Z
dc.date.issued 2016
dc.identifier.citation Grippo, L. N., Mataala, M., Safe, M. D. y Stein, M. J. (2016). Convex p-partitions of bipartite graphs. Theoretical Computer Science, (609), 511-514
dc.identifier.issn 0304-3975
dc.identifier.uri http://repositorio.ungs.edu.ar:8080/xmlui/handle/UNGS/1580
dc.description Fil: Grippo, Luciano Norberto. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina.
dc.description Fil: Grippo, Luciano Norberto. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina.
dc.description Fil: Safe, Martín D. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina.
dc.description Fil: Matamala, Martín. Universidad de Chile. Departamento de Ingeniería Matemática; Chile.
dc.description Fil: Stein, Maya J. Universidad de Chile. Centro de Modelamiento Matemático (CNRS-UMI 2807); Chile.
dc.description.abstract A 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.
dc.format application/pdf
dc.language eng
dc.publisher Elsevier Science BV
dc.rights info:eu-repo/semantics/openAccess
dc.rights https://creativecommons.org/licenses/by-nc-nd/4.0/
dc.source Theoretical Computer Science. 2016; (609): 511-514
dc.source.uri http://www.sciencedirect.com/science/article/pii/S0304397515010117
dc.subject Bipartite graph
dc.subject Convex partition
dc.subject Graph convexity
dc.subject Geodesic convexity
dc.title Convex p-partitions of bipartite graphs
dc.type info:eu-repo/semantics/article
dc.type info:ar-repo/semantics/artículo
dc.type info:eu-repo/semantics/publishedVersion


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics