A SIMPLE LINEAR-TIME ALGORITHM FOR COMPUTING THE CENTER OF AN INTERVAL GRAPH

被引：35
|
作者：
OLARIU, S
机构：
[1] Department of Computer Science, Old Dominion University, Norfolk
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1990年 / 34卷 / 3-4期
关键词：
center; diameter; Interval graphs; linear-time algorithms;
D O I：
10.1080/00207169008803870
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The computational problem of finding the center of a graph is motivated by a number of facility-location problems. We exploit a new characterization of interval graphs for the purpose of obtaining a linear-time algorithm for computing both the center and the diameter of an interval graph. © 1990, Taylor & Francis Group, LLC. All rights reserved.
引用
收藏
页码：121 / 128
页数：8
相关论文
共 50 条
12345