Computing Linking Numbers of a Filtration

DOI10.1007/3-540-44696-6_9MaRDI QIDQ4801143zbMATH OpenOpenAlexFDO

Authors Afra Zomorodian, Herbert Edelsbrunner

Publication date 6 April 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.hha/1088453320

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Analysis of algorithms (68W40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) General low-dimensional topology (57M99)

Recommendations

• Computing linking numbers of a filtration
• Computational topology. An introduction
• A combinatorial algorithm for computing higher order linking numbers
• Topology for Computing
• Topological persistence and simplification

Cited in

(1)

• Computing linking numbers of a filtration

This page was built for publication: Computing Linking Numbers of a Filtration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4801143)