Solving Maximum Weighted Matching on Large Graphs with Deep Reinforcement Learning

---

Datasets

• Synthetic Datasets, to get implementation from Networkx.

  1. erdos_renyi_graph
  2. barabasi_albert_graph
  3. holme_kim_graph
  4. watts_strogatz_graph

• Real-world Datasets, to get from SNAP.

Compare with

• LwD@Learning What to Defer for Maximum Independent Sets
• DGL-TreeSearch@WHAT’S WRONG WITH DEEP LEARNING IN TREE SEARCH FOR COMBINATORIAL OPTIMIZATION

Running

For training,

python run_l2m.py --mode train

For testing,

python run_l2m.py --mode test