A parllel algorithm for finding a maximum weight clique of an interval graph
From MaRDI portal
Publication:582125
DOI10.1016/0167-8191(90)90152-YzbMath0689.68094OpenAlexW1969414442MaRDI QIDQ582125
Publication date: 1990
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(90)90152-y
parallel algorithminterval graphcomplexity analysisEREW-PRAMmaximum weight cliqueparallel random access machine
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
Distributed algorithms for maximum cliques ⋮ Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
This page was built for publication: A parllel algorithm for finding a maximum weight clique of an interval graph
