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.
en_US
Patrocinador
dc.description.sponsorship
CONICET (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-24F