AI Summary: Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search

This paper studies the problem of finding graphs that maximize the number of edges, while avoiding short cycles. It formulates graph generation as a reinforcement learning task, and compares methods like AlphaZero and tabu search. A key finding is that using a curriculum - building larger graphs from good smaller graphs - significantly improves performance. The work makes progress on an open problem in extremal graph theory.

TransformerCVAE/data/arxiv/artificial intelligence_10047_15000_15_title.txt at master · fangleai/TransformerCVAE · GitHub

Supergraph Topology Feature Index for Personalized Interesting Subgraph Query in Large Labeled Graphs

Petar Veličković auf LinkedIn: #ai4science

Anian Ruoss (@anianruoss) / X

LinkedInのPetar Veličković: Our Learning on Graphs Conference tutorial on Neural Algorithmic Reasoning…

Satheesh Kumar V na LinkedIn: Synechron CEO's Winning Formula: Agile, ethical, and culturally strong

Anian Ruoss (@anianruoss) / X

AI Summary: Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search

A new hyper-heuristic based on ant lion optimizer and Tabu search algorithm for replica management in cloud environment

State of AI Report: Compute Index V2 update!

graphml - Telegram channel posts - Graph Machine Learning - Telemetrio