h-Assignments of simplicial complexes and reverse search

Sonoko Moriyama, Masahiro Hachimori

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)594-597
Number of pages4
JournalDiscrete Applied Mathematics
Volume154
Issue number3
DOIs
Publication statusPublished - 2006 Mar 1

Keywords

  • Reverse search
  • Shellability
  • Simplicial complexes
  • h-Assignments

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'h-Assignments of simplicial complexes and reverse search'. Together they form a unique fingerprint.

Cite this