Note: h-Assignments of simplicial complexes and reverse search

Authors:
Sonoko Moriyama;Masahiro Hachimori
Affiliations:
Department of Computer Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033, Japan;Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Ibaraki 305-8573, Japan
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 2
Cited 0

Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Polymake: an approach to modular software design in computational geometry

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry

Quantified Score

Hi-index	0.04

Visualization

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.