Computing linking numbers of a filtration

H. Edelsbrunner, A. Zomorodian, Homology, Homotopy and Applications 5 (2003) 19–37.

Download
No fulltext has been uploaded. References only!
Journal Article | Published | English
Author
Abstract
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration.We give experimental results in applying our work toward the detection of non-trivial tangling in biomolecules, modeled as alpha complexes.
Publishing Year
Date Published
2003-04-22
Journal Title
Homology, Homotopy and Applications
Volume
5
Issue
2
Page
19 - 37
IST-REx-ID

Cite this

Edelsbrunner H, Zomorodian A. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 2003;5(2):19-37.
Edelsbrunner, H., & Zomorodian, A. (2003). Computing linking numbers of a filtration. Homology, Homotopy and Applications, 5(2), 19–37.
Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” Homology, Homotopy and Applications 5, no. 2 (2003): 19–37.
H. Edelsbrunner and A. Zomorodian, “Computing linking numbers of a filtration,” Homology, Homotopy and Applications, vol. 5, no. 2, pp. 19–37, 2003.
Edelsbrunner H, Zomorodian A. 2003. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 5(2), 19–37.
Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” Homology, Homotopy and Applications, vol. 5, no. 2, International Press, 2003, pp. 19–37.

Link(s) to Main File(s)
Access Level
Restricted Closed Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar