The weighted maximum independent set problem in permutation graphs
type: Item
instance of: scholarly article
title: The weighted maximum independent set problem in permutation graphs
zbMATH Open document ID: 0757.68065
DOI: 10.1007/BF01994845
author: Gen-Huey Chen
author: C. W. Yu
published in: BIT
publication date: 1993-01-26T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 86149
zbMATH Keywords: maximum independent set
zbMATH Keywords: permutation graph
zbMATH Keywords: CREW PRAM
zbMATH Keywords: CRCW PRAM
MaRDI profile type: Publication
cites work: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
cites work: Finding a minimum independent dominating set in a permutation graph
cites work: On domination problems for permutation and other graphs
cites work: Domination in permutation graphs
cites work: Q4198056
cites work: Q3328583
cites work: Scanline algorithms on a grid
cites work: Q5585020
cites work: Q3732972
cites work: Q5581642
cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs
cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization
cites work: On Comparability and Permutation Graphs
cites work: Bipartite permutation graphs
cites work: Decomposing a set of points into chains, with applications to permutation and circle graphs
full work available at URL: https://doi.org/10.1007/bf01994845
OpenAlex ID: W2000281299
description: scientific article; zbMATH DE number 86149