| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650189 | Discrete Mathematics | 2007 | 6 Pages |
Abstract
Constructibility is a combinatorial property of simplicial complexes. In general, it requires a great deal of time to decide whether a simplicial complex is constructible or not. In this paper, we consider sufficient conditions for nonconstructibility of simplicial 3-balls to investigate efficient algorithms for the decision problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Satoshi Kamei,