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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science 2016-01, Vol.609, p.511-514
Hauptverfasser:	Grippo, Luciano N., Matamala, Martín, Safe, Martín D., Stein, Maya J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Bipartite graph Computational geometry Convex partition Convexity Geodesic convexity Graph convexity Graph theory Graphs Partitions Polynomials Shortest-path problems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0304-3975 1879-2294
DOI:	10.1016/j.tcs.2015.11.014