id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_mfo4kdtxkze3tmgueggfzpuxci	J. Frederico Carvalho	An algorithm for calculating top-dimensional bounding chains	2018	12	.pdf	application/pdf	5328	569	73	We describe the Coefficient-Flow algorithm for calculating the bounding chain of an approach to ours using a combinatorial method to compute bounding chains of 1-cycles dimensional cycle, and we show that the proposed algorithm has a complexity which is linear method for calculating the minimum area bounding chain of a 1-cycle on a 2d mesh, that bounding chains of 1-cycles in 3-dimensional complexes, using a spanning tree of the dual In order to prove that the Coefficient-Flow algorithm solves problem (1), will use the form the corresponding bounding chain as computed by the Coefficient-Flow algorithm. the edges in blue form cycles, and the faces in red form the corresponding bounding chain as computed Table 1 Timing for computation of bounding chains using Coefficient-Flow, and using Eigen in its bounding chain using both Coefficient-Flow and by solving the sparse linear system as While the problem of finding a bounding chain for a given cycle in a simplicial complex	./cache/work_mfo4kdtxkze3tmgueggfzpuxci.pdf	./txt/work_mfo4kdtxkze3tmgueggfzpuxci.txt