5 papers
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class
Erin Wolf Chambers, Salman Parsa, Hannah Schreiber
Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in…
Distinguishing locally finite trees
Svenja Hüning, Wilfried Imrich, Judith Kloas +2
The distinguishing number of a graph is the smallest number of colors that is needed to color the vertices of such that the only color preserving automorphism is the…
Discrete Morse Theory for Computing Zigzag Persistence
Clément Maria, Hannah Schreiber
We introduce a theoretical and computational framework to use discrete Morse theory as an efficient preprocessing in order to compute zigzag persistent homology. From a zigzag filt…
Distinguishing graphs of maximum valence 3
Svenja Hüning, Wilfried Imrich, Judith Kloas +2
The distinguishing number of a graph is the smallest number of colors that is needed to color such that the only color preserving automorphism is the identity. We gi…
Barcodes of Towers and a Streaming Algorithm for Persistent Homology
Michael Kerber, Hannah Schreiber
A tower is a sequence of simplicial complexes connected by simplicial maps. We show how to compute a filtration, a sequence of nested simplicial complexes, with the same persistent…