2 citations · 2 across the 1 of their papers we have counts for
1 paper
Marc Gillé
A graph G=(V,E) can be described by the characteristic function of the edge set χE which maps a pair of binary encoded nodes to 1 iff the nodes are adjacent. Using \emph{Ord…