On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
From MaRDI portal
Publication:3627689
DOI10.1007/978-3-540-87477-5_18zbMath1160.90707OpenAlexW1590778798MaRDI QIDQ3627689
Publication date: 13 May 2009
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87477-5_18
Related Items
On risk-averse maximum weighted subgraph problems ⋮ Parallelization of a branch-and-bound algorithm for the maximum weight clique problem ⋮ Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
Uses Software
Cites Work