Approximation algorithms for Max Morse matching
DOI10.1016/j.comgeo.2016.10.002zbMath1375.65037arXiv1604.04707OpenAlexW2340262195MaRDI QIDQ2362103
Abhishek Rathod, Talha Bin Masood, Vijay Natarajan
Publication date: 5 July 2017
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.04707
algorithmsimplicial complexapproximation algorithmscomputational topologydiscrete Morse theoryHasse graphMax Morse matching problemsimplicial \(D\)-manifolds
Abstract critical point theory (Morse theory, Lyusternik-Shnirel'man theory, etc.) in infinite-dimensional spaces (58E05) Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Singular homology and cohomology theory (55N10)
Uses Software
Cites Work
- Unnamed Item
- Morse theory for filtrations and efficient computation of persistent homology
- Optimal topological simplification of discrete functions on surfaces
- On optimizing discrete Morse functions
- Coreduction homology algorithm
- Morse theory for cell complexes
- Optimal discrete Morse functions for 2-manifolds
- A user's guide to discrete Morse theory
- Computational homology
- A computationally intractable problem on simplicial complexes
- On discrete Morse functions and combinatorial decompositions
- Parameterized Complexity of Discrete Morse Theory
- Perfect Discrete Morse Functions on Triangulated 3-Manifolds
- Topology and data
- Homological connectivity of random k -dimensional complexes
- Toward Optimality in Discrete Morse Theory
- Molecular shape analysis based upon the morse-smale complex and the connolly function
- Computing Optimal Morse Matchings
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Combinatorial algebraic topology
This page was built for publication: Approximation algorithms for Max Morse matching
