Convex p-partitions of bipartite graphs

被引：6
|
作者：
Grippo, Luciano N. [1 ]
Matamala, Martin [2 ,3 ]
Safe, Martin D. [1 ]
Stein, Maya J. [3 ]
机构：
[1] Univ Nacl Gen Sarmiento, Inst Ciencias, Buenos Aires, DF, Argentina
[2] Univ Chile, Dept Ingn Matemat, Santiago, Chile
[3] Univ Chile, Ctr Modelamiento Matemat, CNRS, UMI 2807, Santiago, Chile
来源：
THEORETICAL COMPUTER SCIENCE | 2016年 / 609卷
关键词：
Bipartite graph; Convex partition; Graph convexity; Geodesic convexity; NUMBER;
D O I：
10.1016/j.tcs.2015.11.014
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：511 / 514
页数：4
相关论文
共 50 条
12345