A Aralex Aachen research explorer

March 24, 2024 conference-paper Open access

A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem

Proceedings of the AAAI Conference on Artificial Intelligence

DOI: 10.1609/aaai.v38i18.30065 Full text (OA) OpenAlex

Authors 0

Author list not loaded yet.

Cited by 0 stored of 1

References 1

An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
2020 Journal of Combinatorial Optimization article Computer Science Complexity and Algorithms in Graphs

7

citations

1 result