Minimal proper interval completions

被引:0
|
作者
Rapaport, Ivan [1 ,2 ]
Suchan, Karol [3 ,4 ]
Todinca, Ioan [3 ]
机构
[1] Univ Chile, Dept Ingn Matemat, Santiago, Chile
[2] Univ Chile, Ctr Modelamiento Matemat, Santiago, Chile
[3] Univ Orleans, LIFO, F-45067 Orleans 2, France
[4] AGH Univ Sci & Technol, Fac Appl Math, Dept Discrete Math, Krakow, Poland
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E subset of F we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich graph H' = (V, F') with E subset of F' subset of F, H' is not a proper interval graph. In this paper we give a O(n + m) time algorithm computing a minimal proper interval completion of an arbitrary graph. The output is a proper interval model of the completion.
引用
收藏
页码:217 / +
页数:3
相关论文
共 50 条