 While our heuristics are fast and do not need any training, using GNNs ensures highest accuracy when predicting the arrival of complex graph structures, both dense (e.g., k-cliques) and sparse (e.g., k-stars).
<clarity>  While our heuristics are fast and do not need any training, using GNNs ensures highest accuracy when predicting the arrival of complex graph structures, both dense (e.g., k-cliques) and sparse (e.g., k-stars).
 While our heuristics are fast and do not need any training, using GNNs ensures highest accuracy when predicting the arrival of complex graph structures, both dense (e.g., k-cliques) and for sparse ones (e.g., k-stars).