On merge trees and discrete Morse functions on paths and trees
The paper provides an extensive and detailed analysis of the properties of merge trees. It predominantly focuses on cases where the analyzed space is a topological tree. The author explores different equivalence relations between discrete Morse functions (dMf) and merge trees, presenting their properties. The paper shows that every merge tree finds its realization in a certain dMf on a space that is a topological interval. While the work can be technical and tedious in places (due to the nature of the topic, not the writing), it serves as an great reference for further studies on merge trees.
- Merge trees in discrete Morse theory
- The realization problem for discrete Morse functions on trees
- Discrete Morse functions, vector fields, and homological sequences on trees
- On discrete Morse functions and combinatorial decompositions
- Discrete Morse functions for graph configuration spaces
- Discrete Morse theory on graphs
- On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees
- On the Merrifield-Simmons index of trees
- scientific article; zbMATH DE number 894188
- The number of excellent discrete Morse functions on graphs
This page was built for publication: On merge trees and discrete Morse functions on paths and trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102906)