Tree checking for sparse complexes
M Caboara, S Faridi, P Selinger - … , Castro Urdiales, Spain, September 1-3 …, 2006 - Springer
M Caboara, S Faridi, P Selinger
Mathematical Software-ICMS 2006: Second International Congress on Mathematical …, 2006•Springer… We detail here the sparse variant of the algorithm sketched in [2] for checking if a simplicial
complex is a tree. A full worst case complexity analysis is given and several optimizations are
discussed. The practical complexity is discussed for some examples. … The main goal of this
paper is to give a detailed description and worst time complexity for a sparse variant of the
tree-checking algorithm introduced in the paper [2]. For all the proofs in Sects. 2-3 we refer to [2].
… 4 we present the main result of this paper, the full description of a variant of the tree checking …
complex is a tree. A full worst case complexity analysis is given and several optimizations are
discussed. The practical complexity is discussed for some examples. … The main goal of this
paper is to give a detailed description and worst time complexity for a sparse variant of the
tree-checking algorithm introduced in the paper [2]. For all the proofs in Sects. 2-3 we refer to [2].
… 4 we present the main result of this paper, the full description of a variant of the tree checking …
Abstract
We detail here the sparse variant of the algorithm sketched in [2] for checking if a simplicial complex is a tree. A full worst case complexity analysis is given and several optimizations are discussed. The practical complexity is discussed for some examples.
Springer
Showing the best result for this search. See all results