Sciweavers

Share
TCS
2016

Convex p-partitions of bipartite graphs

3 years 7 days ago
Convex p-partitions of bipartite graphs
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.
Luciano N. Grippo, Martín Matamala, Mart&ia
Added 10 Apr 2016
Updated 10 Apr 2016
Type Journal
Year 2016
Where TCS
Authors Luciano N. Grippo, Martín Matamala, Martín Darío Safe, Maya J. Stein
Comments (0)
books