Efficient algorithms to decide tightness

DOI10.4230/LIPIcs.SoCG.2016.12zbMath1387.52008arXiv1412.1547MaRDI QIDQ3132845

Nitin Singh, Bhaskar Bagchi, Jonathan Spreer, Benjamin A. Burton, Basudeb Datta

Publication date: 30 January 2018

Full work available at URL: https://arxiv.org/abs/1412.1547

zbMATH Keywords

simplicial complexespolynomial-time algorithmsfixed-parameter tractabilitytight triangulationsdiscrete geometry and topology

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Simplicial sets and complexes in algebraic topology (55U10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items (3)

A Construction Principle for Tight and Minimal Triangulations of Manifolds ⋮ Tight triangulations of closed 3-manifolds ⋮ The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex

This page was built for publication: Efficient algorithms to decide tightness