Showing 2017Show all
2 papers · 1 filter
math.CO2017
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…
math.AT2017
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…