Parallel Unconstrained Local Search for Partitioning Irregular Graphs.

Lars Gottesbüren

Daniel Seemaier

Published in ALENEX 2024

Topics

graph partitioning search algorithm satisfiability testing search space graph matching graph theoretic shared memory graph theory parallel processing spectral graph combinatorial optimization load balance genetic algorithm systematic search partitioning algorithm irregularly shaped parallel computing graph representation memetic algorithm global search computer architecture depth first search data partitioning graph search subgraph isomorphism bipartite graph tabu search constraint satisfaction problems optimal solution