A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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.doi:10.1016/j.dam.2005.09.006 fatcat:3rmtnc2lqva2topl63sdj6gehe