Barabási–Albert graphs
Benchmarks
| Task Name | Dataset Name | SOTA Result | Trend | |
|---|---|---|---|---|
| Causal Structure Discovery | Barabási–Albert graphs 40 nodes | Structural Hamming Distance105 | 12 | |
| Elementary Shortest Path with Negative Cycles | Barabási-Albert (BA) graphs n=50 | Best Path Cost-17.79 | 6 | |
| Elementary Shortest Path with Negative Cycles | Barabási-Albert (BA) graphs n=500 | Best Path Cost-349.1 | 5 | |
| Maximum Cut | Barabási-Albert (BA) graphs (100~128 vertices) | Max Cut Size91.5 | 2 | |
| Maximum Cut | Barabási-Albert (BA) graphs 16~20 vertices | Max Cut Size99.1 | 2 |
Showing 5 of 5 rows