A carregar...
An algorithm for calculating top-dimensional bounding chains
We describe the Coefficient-Flow algorithm for calculating the bounding chain of an $(n-1)$-boundary on an $n$-manifold-like simplicial complex $S$. We prove its correctness and show that it has a computational time complexity of O(|S((n−1))|) (where S((n−1)) is the set of $(n-1)$-faces of $S$). We...
Na minha lista:
| Publicado no: | PeerJ Comput Sci |
|---|---|
| Main Authors: | , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
PeerJ Inc.
2018
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7924431/ https://ncbi.nlm.nih.gov/pubmed/33816807 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.7717/peerj-cs.153 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|