1 paper · 1 filter
Chris Kapulkin, Nathan Kershaw
Machine computation of the discrete homology of graphs has stopped at degree two. We present an algorithm that reaches degree four. It generates the singular cubes inductively, pai…