INVESTIGADORES
SAFE Martin Dario
artículos
Título:
Convex p-partitions of bipartite graphs
Autor/es:
LUCIANO NORBERTO GRIPPO; MARTÍN MATAMALA; MARTÍN DARÍO SAFE; MAYA JAKOBINE STEIN
Revista:
THEORETICAL COMPUTER SCIENCE
Editorial:
ELSEVIER SCIENCE BV
Referencias:
Lugar: Amsterdam; Año: 2016 vol. 609 p. 511 - 514
ISSN:
0304-3975
Resumen:
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≥1p≥1, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial time.
