A LINEAR-TIME ALGORITHM FOR PROPER INTERVAL GRAPH RECOGNITION

被引：35
|
作者：
DEFIGUEIREDO, CMH
MEIDANIS, J
DEMELLO, CP
机构：
[1] UNIV ESTADUAL CAMPINAS, DEPT CIENCIA COMP, BR-13081 CAMPINAS, BRAZIL
[2] FED UNIV RIO DE JANEIRO, INST MATEMAT, BR-21944 RIO DE JANEIRO, BRAZIL
来源：
INFORMATION PROCESSING LETTERS | 1995年 / 56卷 / 03期
基金：
巴西圣保罗研究基金会;
关键词：
DESIGN OF ALGORITHMS; INTERVAL GRAPHS; INDIFFERENCE GRAPHS;
D O I：
10.1016/0020-0190(95)00133-W
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Interval graphs are the intersection graphs of families of intervals in the real line. If the intervals can be chosen so that no interval contains another, we obtain the subclass of proper interval graphs. We show how to recognize proper interval graphs in linear time by constructing the clique partition from the output of a single lexicographic breadth-first search.
引用
收藏
页码：179 / 184
页数：6
相关论文
共 50 条
12345