A simple linear-time algorithm for computing the center of an interval graph
type: Item
instance of: scholarly article
title: A simple linear-time algorithm for computing the center of an interval graph
zbMATH Open document ID: 0699.68073
DOI: 10.1080/00207169008803870
author: Stephan Olariu
published in: International Journal of Computer Mathematics
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4147520
zbMATH Keywords: interval graph
zbMATH Keywords: linear-time algorithm
zbMATH Keywords: center
zbMATH Keywords: diameter
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1080/00207169008803870
OpenAlex ID: W2102564932
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Computation of the center and diameter of outerplanar graphs
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Q3328583
cites work: Q3898496
Recommended article: Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
Recommended article: Q2753927
Recommended article: Q3539510
Recommended article: An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
Recommended article: Efficient algorithms for centers and medians in interval and circular-arc graphs
description: scientific article; zbMATH DE number 4147520