D. Anekstein

most citedCarving-width and contraction trees for tensor networks

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

cs.DM2019★ 1 cited

Carving-width and contraction trees for tensor networks

J. Jakes-Schauer, D. Anekstein, P. Wocjan

We study the problem of finding contraction orderings on tensor networks for physical simulations using a syncretic abstract data type, the $contraction-tree$ , and explain…

math.CO2018

More Tales of Hoffman: bounds for the vector chromatic number of a graph

Pawel Wocjan, Clive Elphick, David Anekstein

Let $χ (G)$ denote the chromatic number of a graph and $χ_{v} (G)$ denote the vector chromatic number. For all graphs $χ_{v} (G) \leq χ (G)$ and for some graphs $χ_{v} (G) ≪ χ (G)$ . Galtman p…