A linear time algorithm to compute a dominating path in an AT-free graph
type: Item
instance of: scholarly article
title: A linear time algorithm to compute a dominating path in an AT-free graph
zbMATH Open document ID: 0875.68455
DOI: 10.1016/0020-0190(95)00021-4
author: Stephan Olariu
author: Derek G. Corneil
author: Lorna Stewart
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 985319
zbMATH Keywords: Asteroidal triple-free graphs
zbMATH Keywords: Domination
zbMATH Keywords: Algorithms
MaRDI profile type: Publication
full work available at URL: 0020-0190(95)00021-4
OpenAlex ID: W2003352119
cites work: Connected domination and steiner set on asteroidal triple-free graphs
cites work: The complexity of regular subgraph recognition
cites work: Q3797233
cites work: Trapezoid graphs and their coloring
cites work: Permutation Graphs and Transitive Graphs
cites work: Q3328583
cites work: Tolerance graphs
cites work: Domination on Cocomparability Graphs
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: An optimal greedy heuristic to color interval graphs
cites work: Q3898496
description: scientific article; zbMATH DE number 985319