On cycles and merge trees

In this paper, we extend the notion of a merge tree to that of a generalized merge tree, a merge tree that includes 1-dimensional cycle birth information. Given a discrete Morse function on a 1-dimensional CW complex, i.e., a multigraph, we construct the induced generalized merge tree. We give several notions of equivalence of discrete Morse functions based on the induced generalized merge tree and how these notions relate to one another. As a consequence, we obtain a complete solution to the inverse problem between discrete Morse functions on 1-dimensional CW complexes and generalized merge trees. After characterizing which generalized merge trees can be induced by a discrete Morse function on a simple graph, we give an algorithm based on the induced generalized merge tree of a discrete Morse function $f:X\to R$ that cancels the critical cells of f and replaces it with an optimal discrete Morse function.