Efficient algorithms to decide tightness (Q3132845)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms to decide tightness |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms to decide tightness |
scientific article |
Statements
30 January 2018
0 references
discrete geometry and topology
0 references
polynomial-time algorithms
0 references
fixed-parameter tractability
0 references
tight triangulations
0 references
simplicial complexes
0 references
cs.CG
0 references
math.CO
0 references
0.84438527
0 references
0.84123707
0 references
0.83018494
0 references
0.8220781
0 references
0 references
0.8158014
0 references
0 references
