Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
type: Item
instance of: scholarly article
title: Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
zbMATH Open document ID: 0768.68126
DOI: 10.1016/0020-0190(92)90114-B
author: Fu-Hsing Wang
author: Maw-Shang Chang
published in: Information Processing Letters
publication date: 1992-11-29T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 69904
zbMATH Keywords: efficient algorithms
zbMATH Keywords: clique independent set
zbMATH Keywords: overlap graph
zbMATH Keywords: weight independent set
zbMATH Keywords: permutation graphs
MaRDI profile type: Publication
cites work: Permutation Graphs and Transitive Graphs
cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs
cites work: Q4198056
cites work: Algorithms for a maximum clique and a maximum independent set of a circle graph
cites work: Q3328583
cites work: Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
cites work: Finding a maximum independent set in a permutation graph
cites work: On Comparability and Permutation Graphs
full work available at URL: 0020-0190(92)90114-b
OpenAlex ID: W2056944493
description: scientific article; zbMATH DE number 69904