Counting Polygon Triangulations is Hard
- 13 October 2020
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 64 (4) , 1210-1234
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (CCF-1618301, CCF-1616248)
This publication has 39 references indexed in Scilit:
- Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleynʼs techniqueJournal of Combinatorial Theory, Series A, 2013
- On the number of pseudo-triangulations of certain point setsJournal of Combinatorial Theory, Series A, 2008
- On counting homomorphisms to directed acyclic graphsJournal of the ACM, 2007
- A lower bound on the number of triangulations of planar point setsComputational Geometry, 2004
- An upper bound for the number of planar lattice triangulationsJournal of Combinatorial Theory, Series A, 2003
- An efficient algorithm for enumeration of triangulationsComputational Geometry, 2002
- Lower bounds on the number of crossing-free subgraphs of KNComputational Geometry, 2000
- Generating triangulations at randomACM Transactions on Modeling and Computer Simulation, 1994
- On the computational complexity of the Jones and Tutte polynomialsMathematical Proceedings of the Cambridge Philosophical Society, 1990
- ber die Gitterpunkte auf konvexen KurvenMathematische Zeitschrift, 1926