Decision tree field (DTF) on printed-graph 1
0.17Solve Time (s)cBK
Evaluation results
| Method | Links | ||
|---|---|---|---|
| cBKSize type (T)=S, Number of vertices (n)=20 K, Internal edges (m+)=2.3 M, Internal edges without duplicates (mi)=1.1 M2026.05 | 0.17 | 0.19 | |
| fcBKSize type (T)=S, Number of vertices (n)=20 K, Internal edges (m+)=2.3 M, Internal edges without duplicates (mi)=1.1 M2026.05 | 0.24 | 0.26 | |
| mBK-rSize type (T)=S, Number of vertices (n)=20 K, Internal edges (m+)=2.3 M, Internal edges without duplicates (mi)=1.1 M2026.05 | 0.27 | 0.31 | |
| mBKSize type (T)=S, Number of vertices (n)=20 K, Internal edges (m+)=2.3 M, Internal edges without duplicates (mi)=1.1 M2026.05 | 0.41 | 0.42 | |
| BKSize type (T)=S, Number of vertices (n)=20 K, Internal edges (m+)=2.3 M, Internal edges without duplicates (mi)=1.1 M2026.05 | 0.48 | 0.49 |