A parllel algorithm for finding a maximum weight clique of an interval graph

DOI10.1016/0167-8191(90)90152-YzbMath0689.68094MaRDI QIDQ582125

Chii-Huah Shyu

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

parallel algorithm; interval graph; complexity analysis; EREW-PRAM; maximum weight clique; parallel random access machine

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

Related Items

Distributed algorithms for maximum cliques