A parllel algorithm for finding a maximum weight clique of an interval graph
type: Item
instance of: scholarly article
title: A parllel algorithm for finding a maximum weight clique of an interval graph
zbMATH Open document ID: 0689.68094
DOI: 10.1016/0167-8191(90)90152-Y
author: Chii-Huah Shyu
published in: Parallel Computing
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 4130046
zbMATH Keywords: parallel algorithm
zbMATH Keywords: parallel random access machine
zbMATH Keywords: complexity analysis
zbMATH Keywords: EREW-PRAM
zbMATH Keywords: maximum weight clique
zbMATH Keywords: interval graph
MaRDI profile type: Publication
full work available at URL: 0167-8191(90)90152-y
OpenAlex ID: W1969414442
Recommended article: A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
Recommended article: Some approximation algorithms for the clique partition problem in weighted interval graphs
Recommended article: On the clique partitioning problem in weighted interval graphs
Recommended article: A new algorithm for the maximum-weight clique problem
Recommended article: Q4547547
Recommended article: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
Recommended article: A fast algorithm for the maximum weight clique problem
Recommended article: Q3804207
Recommended article: The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)
Recommended article: The maximum clique problem in multiple interval graphs
description: scientific article; zbMATH DE number 4130046