Home /Research /A new branch-and-bound algorithm for the maximum edge-weighted clique problem
OTHER

A new branch-and-bound algorithm for the maximum edge-weighted clique problem

Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubić

Year
2019
Citations
29

Keywords

Clique problemBounding overwatchVertex (graph theory)Branch and boundCliquePruningAlgorithmMathematicsEnhanced Data Rates for GSM EvolutionComputer science

Related papers

Browse all OTHER papers