h-assignments of simplicial complexes and reverse search

DOI10.1016/J.DAM.2005.09.006zbMATH Open1089.52502OpenAlexW1983569380MaRDI QIDQ2489953FDOQ2489953

Authors: Sonoko Moriyama, Masahiro Hachimori 

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.006

Recommendations

• scientific article; zbMATH DE number 1860710
• Shellings from relative shellings, with an application to NP-completeness
• Shellability is NP-complete
• Shellability is NP-complete
• A note on shellability and acyclic orientations

zbMATH Keywords

shellability of simplicial complexes

Mathematics Subject Classification ID

Shellability for polytopes and polyhedra (52B22)

Cites Work

• Polymake: an approach to modular software design in computational geometry
• Lectures on Polytopes
• Reverse search for enumeration
• Title not available (Why is that?)

Cited In (4)

• Simplicial decomposability
• A note on shellability and acyclic orientations
• Frontiers of sphere recognition in practice
• Title not available (Why is that?)

Uses Software

• polymake

This page was built for publication: \(h\)-assignments of simplicial complexes and reverse search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489953)