1 citations · 1 across the 1 of their papers we have counts for
1 paper
Toluwanimi O. Odemuyiwa, Serban D. Porumbescu, Nandeeka Nayak +3
In this work, we propose a unified abstraction for graph algorithms: the Extended General Einsums language, or EDGE. The EDGE language expresses graph algorithms in the language of…