Diverse beam search to find densest-known planar unit distance graphs.

Peter Engel Owen Hammond-Lee Yiheng Su Dániel Varga Pál Zsámboki

Published in: CoRR (2024)

Keyphrases

beam search
graph mining
branch and bound
search algorithm
heuristic search
dense subgraphs
search methods
larger problems
planar graphs
assembly line
hill climbing
search problems
similarity graph
ranking functions
lower bound
computational complexity
feature set
search space
machine learning