Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
