Linear algorithm for optimal path cover problem on interval graphs
type: Item
instance of: scholarly article
title: Linear algorithm for optimal path cover problem on interval graphs
zbMATH Open document ID: 0697.68048
DOI: 10.1016/0020-0190(90)90064-5
author: Srinivasa Rao Arikati
author: C. Pandu Rangan
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 4143443
zbMATH Keywords: interval graphs
zbMATH Keywords: data structures
zbMATH Keywords: design of algorithms
zbMATH Keywords: path covering
MaRDI profile type: Publication
full work available at URL: 0020-0190(90)90064-5
OpenAlex ID: W2054496228
cites work: Q4052166
cites work: Minimum node disjoint path covering for circular-arc graphs
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Q4198056
cites work: Q3328583
cites work: Q4050641
cites work: Advances on the Hamiltonian Completion Problem
cites work: Finding Hamiltonian circuits in interval graphs
cites work: An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
cites work: A unified approach to domination problems on interval graphs
cites work: Linear algorithm for domatic number problem on interval graphs
description: scientific article; zbMATH DE number 4143443