Convex p-partitions of bipartite graphs

Autores
Grippo, Luciano Norberto; Mataala, Martín; Safe, Martín D.; Stein, Maya J.
Año de publicación
2016
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Fil: Grippo, Luciano Norberto. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina.
Fil: Grippo, Luciano Norberto. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina.
Fil: Safe, Martín D. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina.
Fil: Matamala, Martín. Universidad de Chile. Departamento de Ingeniería Matemática; Chile.
Fil: Stein, Maya J. Universidad de Chile. Centro de Modelamiento Matemático (CNRS-UMI 2807); Chile.
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.
Fuente
Theoretical Computer Science. 2016; (609): 511-514
http://www.sciencedirect.com/science/article/pii/S0304397515010117
Materia
Bipartite graph
Convex partition
Graph convexity
Geodesic convexity
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/4.0/
Repositorio
Repositorio Institucional UNGS
Institución
Universidad Nacional de General Sarmiento
OAI Identificador
oai:repositorio.ungs.edu.ar:UNGS/1580
Acceder
id RIUNGS_670790f5253e9e5f98413db0336f7b58
oai_identifier_str oai:repositorio.ungs.edu.ar:UNGS/1580
network_acronym_str RIUNGS
repository_id_str
network_name_str Repositorio Institucional UNGS
spelling Convex p-partitions of bipartite graphsGrippo, Luciano NorbertoMataala, MartínSafe, Martín D.Stein, Maya J.Bipartite graphConvex partitionGraph convexityGeodesic convexityFil: Grippo, Luciano Norberto. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina.Fil: Grippo, Luciano Norberto. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina.Fil: Safe, Martín D. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina.Fil: Matamala, Martín. Universidad de Chile. Departamento de Ingeniería Matemática; Chile.Fil: Stein, Maya J. Universidad de Chile. Centro de Modelamiento Matemático (CNRS-UMI 2807); Chile.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.Elsevier Science BV2024-07-16T17:07:05Z2024-07-16T17:07:05Z2016info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfGrippo, L. N., Mataala, M., Safe, M. D. y Stein, M. J. (2016). Convex p-partitions of bipartite graphs. Theoretical Computer Science, (609), 511-5140304-3975http://repositorio.ungs.edu.ar:8080/xmlui/handle/UNGS/1580Theoretical Computer Science. 2016; (609): 511-514http://www.sciencedirect.com/science/article/pii/S0304397515010117reponame:Repositorio Institucional UNGSinstname:Universidad Nacional de General Sarmientoenginfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/4.0/2025-11-06T10:40:31Zoai:repositorio.ungs.edu.ar:UNGS/1580instacron:UNGSInstitucionalhttp://repositorio.ungs.edu.ar:8080/Universidad públicahttps://www.ungs.edu.ar/http://repositorio.ungs.edu.ar:8080/oaiubyd@campus.ungs.edu.arArgentinaopendoar:2025-11-06 10:40:31.619Repositorio Institucional UNGS - Universidad Nacional de General Sarmientofalse
dc.title.none.fl_str_mv Convex p-partitions of bipartite graphs
title Convex p-partitions of bipartite graphs
spellingShingle Convex p-partitions of bipartite graphs
Grippo, Luciano Norberto
Bipartite graph
Convex partition
Graph convexity
Geodesic convexity
title_short Convex p-partitions of bipartite graphs
title_full Convex p-partitions of bipartite graphs
title_fullStr Convex p-partitions of bipartite graphs
title_full_unstemmed Convex p-partitions of bipartite graphs
title_sort Convex p-partitions of bipartite graphs
dc.creator.none.fl_str_mv Grippo, Luciano Norberto
Mataala, Martín
Safe, Martín D.
Stein, Maya J.
author Grippo, Luciano Norberto
author_facet Grippo, Luciano Norberto
Mataala, Martín
Safe, Martín D.
Stein, Maya J.
author_role author
author2 Mataala, Martín
Safe, Martín D.
Stein, Maya J.
author2_role author
author
author
dc.subject.none.fl_str_mv Bipartite graph
Convex partition
Graph convexity
Geodesic convexity
topic Bipartite graph
Convex partition
Graph convexity
Geodesic convexity
dc.description.none.fl_txt_mv Fil: Grippo, Luciano Norberto. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina.
Fil: Grippo, Luciano Norberto. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina.
Fil: Safe, Martín D. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina.
Fil: Matamala, Martín. Universidad de Chile. Departamento de Ingeniería Matemática; Chile.
Fil: Stein, Maya J. Universidad de Chile. Centro de Modelamiento Matemático (CNRS-UMI 2807); Chile.
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.
description Fil: Grippo, Luciano Norberto. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina.
publishDate 2016
dc.date.none.fl_str_mv 2016
2024-07-16T17:07:05Z
2024-07-16T17:07:05Z
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv 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
0304-3975
http://repositorio.ungs.edu.ar:8080/xmlui/handle/UNGS/1580
identifier_str_mv 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
0304-3975
url http://repositorio.ungs.edu.ar:8080/xmlui/handle/UNGS/1580
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/4.0/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/4.0/
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier Science BV
publisher.none.fl_str_mv Elsevier Science BV
dc.source.none.fl_str_mv Theoretical Computer Science. 2016; (609): 511-514
http://www.sciencedirect.com/science/article/pii/S0304397515010117
reponame:Repositorio Institucional UNGS
instname:Universidad Nacional de General Sarmiento
reponame_str Repositorio Institucional UNGS
collection Repositorio Institucional UNGS
instname_str Universidad Nacional de General Sarmiento
repository.name.fl_str_mv Repositorio Institucional UNGS - Universidad Nacional de General Sarmiento
repository.mail.fl_str_mv ubyd@campus.ungs.edu.ar
_version_ 1848049041289510912
score 12.976206

Publicaciones similares