Search Results for author: Roman Erhardt

Found 1 papers, 0 papers with code

Improved Exact and Heuristic Algorithms for Maximum Weight Clique

no code implementations1 Feb 2023 Roman Erhardt, Kathrin Hanauer, Nils Kriege, Christian Schulz, Darren Strash

We propose improved exact and heuristic algorithms for solving the maximum weight clique problem, a well-known problem in graph theory with many applications.

Cannot find the paper you are looking for? You can Submit a new open access paper.