Revisiting graph persistence for updates and efficiency

DOI10.1007/978-3-031-38906-1_24arXiv2302.12796MaRDI QIDQ6179426

Tamal Krishna Dey, Salman Parsa, Tao Hou

Publication date: 16 January 2024

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

Full work available at URL: https://arxiv.org/abs/2302.12796

zbMATH Keywords

zigzag persistencedynamic updategraph persistencevines and vineyard

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending persistence using Poincaré and Lefschetz duality
• Topological persistence and simplification
• Zigzag persistence
• A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
• Unzerlegbare Darstellungen. I. (Indecomposable representations. I)
• Dynamic Subtrees Queries Revisited: The Depth First Tour Tree
• Data structures for mergeable trees
• Computational Topology for Data Analysis
• Zigzag Persistence via Reflections and Transpositions
• Zigzag persistent homology and real-valued functions
• Zigzag persistent homology in matrix multiplication time
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

This page was built for publication: Revisiting graph persistence for updates and efficiency