There is currently no efficient algorithm for deciding whether a given simplicial complex is shellable. We propose a practical method that decides shellability of simplicial complexes based on reverse search, which improves an earlier attempt by Moriyama, Nagai and Imai. We also propose to use Macaulay's theorem during the search. This works efficiently in high-dimensional cases.
- Reverse search
- Simplicial complexes
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics