Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10333884 | Theoretical Computer Science | 2016 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Luciano N. Grippo, MartÃn Matamala, MartÃn D. Safe, Maya J. Stein,